Ján Pich
ABSTRACT
We show unconditionally that Cook’s theory PV formalizing poly-time reasoning cannot prove, for any non-deterministic poly-time machine M defining a language L(M), that L(M) is inapproximable by co-nondeterministic circuits of sub-exponential size. In fact, our unprovability result holds also for a theory which supports a fragment of Jeřábek’s theory of approximate counting APC1. We also show similar unconditional unprovability results for the conjecture of Rudich about the existence of super-bits.
- Alekhnovich M., Ben-Sasson E., Razborov A.A., Wigderson A. ; Pseudorandom generators in propositional proof complexity, SIAM Journal on Computing, 34 ( 1 ): 67-88, 2004.Google Scholar
- Aaronson, S., Wigderson, A. ; Algebrization: A New Barrier in Complexity Theory, Transactions in Computation Theory, 2 : 1-54, 2009.Google Scholar
- Baker T., Gill J., Solovay R. ; Relativizations of the P = NP Question, SIAM Journal on Computing, 4 ( 4 ), pp. 431-442, 1975.Google Scholar
- Buss S. ; Bounded Arithmetic, Bibliopolis, 1986.Google Scholar
- Buss S., Kołodziejczyk L., Thapen N. ; Fragments of Approximate Counting, Journal of Symbolic Logic, 49 : 496-525, 2014.Google Scholar
- Bydžovský J., Müller M. ; Polynomial time ultrapowers and the consistency of circuit lower bounds, Arch. Math. Log., 59 ( 1 ): 127-147, 2020.Google Scholar
- Bydžovský J., Krajíček J., Oliveira I.C. ; Consistency of circuit lower bounds with bounded theories, Logical Methods in Computer Science, 16 ( 2 :12), 2020.Google Scholar
- Carmosino M., Impagliazzo R., Kabanets V., Kolokolova A. ; Learning algorithms from natural proofs, Conference on Computational Complexity, 10 : 1-24, 2016.Google Scholar
- Chen L., Hirahara S., Oliveira I.C., Pich J., Rajgopal N., Santhanam R. ; Beyond natural proofs: hardness magnification and locality, Innovations in Theoretical Computer Science, 70 : 1-48, 2020.Google Scholar
- Cobham A. ; The intrinsic computational dificulty of functions, International Congress of Logic, Methodology and Philosophy of Science, North Holland, pp. 24-30, 1965.Google Scholar
- Cook S.A. ; Feasibly constructive proofs and the propositional calculus, Symposium on the Theory of Computing, pp. 83-97, 1975.Google Scholar
- Cook S., Krajíček J.; Consequences of the Provability of NP ⊆ P/poly, Journal of Symbolic Logic, 72 ( 4 ): 1353-1371, 2007.Google Scholar
- Cook S.A., Pitassi T. ; A feasibly constructive lower bound for Resolution proofs, Information Processing Letters, 34 ( 2 ): 81-85, 1990.Google Scholar
- Cook S.A., Thapen N.; The strength of replacement in weak arithmetic, ACM Transactions on Computational Logic, 7 ( 4 ): 749-764, 2006.Google Scholar
- Dai Tri Man Le ; Bounded arithmetic and formalizing probabilistic proofs, Ph.D. thesis, University of Toronto, 2014.Google Scholar
- Filmus Y., Pitassi T., Santhanam R. ; Exponential lower bounds for AC0-Frege imply superpolynomial Frege lower bounds, International Colloquium on Automata, Languages and Programming, 6755 : 618-629, 2011.Google Scholar
- Healy A., Vadhan S., Viola E. ; Using nondeterminism to amplify hardness, Symposium on the Theory of Computing, pp. 192-201, 2004.Google ScholarDigital Library
- Huang H. ; Induced Subgraphs of Hypercubes and a Proof of the Sensitivity Conjecture, Arxiv preprint, 2019.Google Scholar
- Jeřábek E. ; Dual weak pigeonhole principle, Boolean complexity and derandomization, Annals of Pure and Applied Logic, 129 : 1-37, 2004.Google Scholar
- Jeřábek E. ; Weak pigeonhole principle and randomized computation, Ph.D. thesis, Charles University in Prague, 2005.Google Scholar
- Jeřábek E. ; Approximate counting in bounded arithmetic, Journal of Symbolic Logic, 72 : 959-993, 2007.Google Scholar
- Krajíček J.; Bounded arithmetic, propositional logic, and complexity theory, Cambridge University Press, 1995.Google Scholar
- Krajíček J. ; On the weak pigeonhole principle, Fundamenta Mathematicae, 170 ( 1-3 ): 123-140, 2001.Google Scholar
- Krajíček J.; Dual weak pigeonhole principle, pseudor-surjective functions, and provability of circuit lower bounds, Journal of Symbolic Logic, 69 ( 1 ): 265-286, 2004.Google Scholar
- Krajíček J.; Implicit proofs, Journal of Symbolic Logic, 69 ( 2 ): 387-397, 2004.Google Scholar
- Krajíček J. ; On the proof complexity of the Nisan-Wigderson generator based on a hard NP ∩ coNP function, Journal of Mathematical Logic, 11 ( 1 ): 11-27, 2011.Google Scholar
- Krajíček J. ; On the computational complexity of finding hard tautologies, Bulleting of the London Mathematical Society, 46 ( 1 ): 111-125, 2014.Google Scholar
- Krajíček J. ; Proof complexity, Cambridge University Press, 2019.Google Scholar
- Krajíček J.; A limitation on the KPT interpolation, Logical Methods in Computer Science, 16 ( 3 :9), 2020.Google Scholar
- Krajíček J., Oliveira I.C. ; Unprovability of circuit upper bounds in Cook's theory PV1, Logical Methods in Computer Science, 13 ( 1 ), 2017.Google Scholar
- Krajíček J., Pudlák P.; Some consequences of cryptographical conjectures for S12 and EF, Information and Computation, 140 ( 1 ): 82-94, 1998.Google Scholar
- Krajíček J., Pudlák P., Takeuti G. ; Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, 52 : 143-153, 1991.Google Scholar
- Lipton R.J., Young N.E. ; Simple strategies for large zero-sum games with applications to complexity theory, Symposium on Theory of Computing, pp. 734-740, 1994.Google ScholarDigital Library
- Müller M., Pich J.; Feasibly constructive proofs of succinct weak circuit lower bounds, Annals of Pure and Applied Logic, 171 ( 2 ), 2020.Google Scholar
- Nisan N., Wigderson A. ; Hardness vs. randomness, J. Comput. Systems Sci., 49 : 149-167, 1994.Google ScholarDigital Library
- Paris J., Wilkie A. ; Counting problems in bounded arithmetic, Methods in Mathematical Logic, 1130 : 317-340, 1985.Google Scholar
- Pich J. ; Nisan-Wigderson generators in proof systems with forms of interpolation, Mathematical Logic Quarterly, 57 ( 4 ), 2011.Google Scholar
- Pich J.; Circuit lower bounds in bounded arithmetics, Annals of Pure and Applied Logic, 166 ( 1 ): 29-45, 2015.Google Scholar
- Pich J. ; Logical Strength of Complexity Theory and a formalization of the PCP theorem in bounded arithmetic, Logical Methods in Computer Science, 11 ( 2 ), 2015.Google Scholar
- Pich J., Santhanam R. ; Why are proof complexity lower bounds hard? Symposium on Foundations of Computer Science, pp. 1305-1324, 2019.Google ScholarCross Ref
- Pudlák P. ; Lower Bounds for Resolution and Cutting Plane proofs and Monotone computations; J. of Symb. Logic, 62 ( 3 ): 981-998, 1997.Google Scholar
- Razborov A.A. ; Bounded Arithmetic and Lower Bounds in Boolean Complexity, Feasible Mathematics II, pp. 344-386, 1995.Google ScholarCross Ref
- Razborov A.A. ; Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic, Izvestiya of the Russian Academy of Science, 59 : 201-224, 1995.Google Scholar
- Razborov A.A. ; Pseudorandom generators hard for-DNF resolution and polynomial calculus, Annals of Mathematics, 181 ( 2 ): 415-472, 2015.Google Scholar
- Razborov A.A., Rudich S.; Natural proofs, Journal of Computer and System Sciences, 55 ( 1 ): 24-35, 1997.Google Scholar
- Rudich S. ; Super-bits, Demi-bits, and NP/qpoly-natural Proofs, Journal of Computer and System Sciences, 55 : 204-213, 1997.Google Scholar
- Thapen N.; A model-theoretic characterization of the weak pigeonhole principle, Annals of Pure and Applied Logic, 118 ( 1-2 ): 175-195, 2002.Google Scholar
- Thapen N.; The weak pigeonhole principle in models of bounded arithmetic, Ph.D. thesis, Oxford University, 2002.Google Scholar
Index Terms
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly
Recommendations
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-verifier and every yes-instance x of length n for that verifier, the verifier’s search space has an nO(k3)-size witness circuit: a witness for x that can ...
Strong average-case lower bounds from non-trivial derandomization
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of ComputingWe prove that for all constants a, NQP = NTIME[n polylog(n)] cannot be (1/2 + 2−log a n )-approximated by 2log a n -size ACC 0 ∘ THR circuits ( ACC 0 circuits with a bottom layer of THR gates). Previously, it was even open whether E NP can be (1/2+...
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
In several settings, derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence of pseudorandom generators. This leaves open the question whether derandomization implies the circuit lower bounds that are ...
Comments