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.
References
Mahaney's theorem Wikipedia(Text) CC BY-SA
Mahaney's theorem
Updated on
Edit
Like
Comment
Similar Topics