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.[1]

References

  1. ↑ Mahaney, Stephen R. (October 1982). "Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis". Journal of Computer and System Sciences 25 (2): 130–143. doi:10.1016/0022-0000(82)90002-2.
This article is issued from Wikipedia - version of the Wednesday, July 22, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.