%0 Web Page %A Vega, Frank %D 2018 %T The P = Sharp-P Consequence %U https://figshare.com/articles/online_resource/The_P_Sharp-P_Consequence/5873595 %R 10.6084/m9.figshare.5873595.v3 %K Complexity Classes %K Completeness %K Boolean Circuit %K Graph %K Counting Solutions %K Theoretical Computer Science %X P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity classes are EXP and Sharp-P. Whether Sharp-P = P is another fundamental question that it is as important as it is unresolved. However, we already know that P is not equal to EXP. We prove if Sharp-P = P, then we can determine in polynomial time which subsets could be solved in a feasible polynomial time from every EXP language. %I figshare