Berman's theorem states

If a unary language ( a language with all the strings of the type $1^i$, $ i > 0 $ ) is NP-Complete then P = NP.

I tried reducing SAT to a given unary language $L$ assuming it is NP-Complete. But I can't think of a way such that after applying the reduction so that SAT gets solved in polynomial time. How do I proceed further?

This is an exercise from Sanjeev Arora and Boaz Barak , but not homework.


1 Answer 1


Please refer this solution. Or see the paper by S. R. Mahaney, Sparse complete sets for NP: Solution of a conjecture by Berman and Hartmanis (Journal of Computer and System Sciences, 25:130-143, 1982).


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.