Consistency of circuit lower bounds with bounded theories

by   Jan Bydzovsky, et al.

Proving that there are problems in P^NP that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only show that the corresponding problems are hard on infinitely many input lengths. For instance, proving almost-everywhere circuit lower bounds is open even for problems in MAEXP. Giving the notorious difficulty of proving lower bounds that hold for all large input lengths, we ask the following question: Can we show that a large set of techniques cannot prove that NP is easy infinitely often? Motivated by this and related questions about the interaction between mathematical proofs and computations, we investigate circuit complexity from the perspective of logic. Among other results, we prove that for any parameter k ≥ 1 it is consistent with theory T that computational class C⊈i.o.SIZE(n^k), where (T, C) is one of the pairs: T = T^1_2 and C = P^NP, T = S^1_2 and C = NP, T = PV and C = P. In other words, these theories cannot establish infinitely often circuit upper bounds for the corresponding problems. This is of interest because the weaker theory PV already formalizes sophisticated arguments, such as a proof of the PCP Theorem (Pich, 2015). These consistency statements are unconditional and improve on earlier theorems of Krajicek and Oliveira (2017) and Bydzovsky and Muller (2018) on the consistency of lower bounds with PV.


page 1

page 2

page 3

page 4


On the Consistency of Circuit Lower Bounds for Non-Deterministic Time

We prove the first unconditional consistency result for superpolynomial ...

Constructive Separations and Their Consequences

For a complexity class C and language L, a constructive separation of L ...

Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic

While there has been progress in establishing the unprovability of compl...

Separating Circuits : Switching Lemmas and Random Restrictions

This was submitted as a final project for CS254B, taught by Li Yang Tan ...

PPP-Completeness and Extremal Combinatorics

Many classical theorems in combinatorics establish the emergence of subs...

Lower Bounds for Matrix Factorization

We study the problem of constructing explicit families of matrices which...

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

A fertile area of recent research has demonstrated concrete polynomial t...

Please sign up or login with your details

Forgot password? Click here to reset