On the complexity of circuit satisfiability

• Authors: Ramamohan Paturi;Pavel Pudlak
• Venue: Proceedings of the forty-second ACM symposium on Theory of computing
• Year: 2010

In this paper, we are concerned with the exponential complexity of the Circuit Satisfiability (CktSat) problem and more generally with the exponential complexity of NP-complete problems. Over the past 15 years or so, researchers have obtained a number of exponential-time algorithms with improved running times for exactly solving a variety of NP-complete problems. The improvements are typically in the form of better exponents compared to exhaustive search. Our goal is to develop techniques to prove specific lower bounds on the exponents under plausible complexity assumptions. We consider natural, though restricted, algorithmic paradigms and prove upper bounds on the success probability. Our approach has the advantage of clarifying the relative power of various algorithmic paradigms. Our main technique is a success probability amplification technique, called the Exponential Amplification Lemma, which shows that for any f(n,m)-size bounded probabilistic circuit family A that decides CktSat with success probability at least 2-α n for α-α2 n 2-α n. In contrast, the standard method for boosting success probability by repeated trials will improve it to (1-(1-2-α n)t) (approx t2-α n for t=O(2α n)) using circuits of size about tf(n,m). Using this lemma, we derive tight bounds on the exponent of the success probability for deciding the CktSat problem in a variety of probabilistic computational models under complexity assumptions. For example, we show that the success probability cannot be better than 2-n+o(n) for deciding CktSat by probabilistic polynomial size circuits unless CktSat (thereby all of NP) for polynomial size instances can be decided by 2nμ size deterministic circuits for some μ -n+o(n) unless CktSat (as well as NP) has O(mO(lg lg m)) size deterministic circuits, which is very close to the statement NP ⊆ P/poly, an unlikely scenario.