 A version of Karp–Lipton theorem states that if every language in NP has polynomial size circuits then the polynomial time hierarchy collapses to S. This result yields a strengthening of Kannan's theorem