Keywords

#mahaney's_theorem

Mahaney's theorem

Mahaney's theorem is a theorem in computational complexity theory proven by Stephen Mahaney that states that if any sparse language is NP-complete, then P = NP. Also, if any sparse language is NP-complete with respect to Turing reductions, then the polynomial-time hierarchy collapses to .

Thu 27th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Mahaney's theorem Sparse language P/poly NP/poly Co-NP-complete Juris Hartmanis Berman–Hartmanis conjecture Unary language
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.