Proving SAT does not have small circuits with an application to the two queries problem

13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if PNP [1] = PNP [2], then the polynomial-time hierarchy collapses to S2p ⊆ Σ2p ∩ Π2p. Even showing that the hierarchy collapsed to Σ2p remained open prior to this paper. © 2007 Elsevier Inc. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Fortnow, L., Pavan, A., & Sengupta, S. (2008). Proving SAT does not have small circuits with an application to the two queries problem. Journal of Computer and System Sciences, 74(3), 358–363. https://doi.org/10.1016/j.jcss.2007.06.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free