Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower Bounds

Journal of Symbolic Logic 69 (1):265 - 286 (2004)
Abstract
This article is a continuation of our search for tautologies that are hard even for strong propositional proof systems like EF, cf. [14, 15]. The particular tautologies we study, the τ-formulas, are obtained from any ᵊ/poly map g; they express that a string is outside of the range of g. Maps g considered here are particular pseudorandom generators. The ultimate goal is to deduce the hardness of the τ-formulas for at least EF from some general, plausible computational hardness hypothesis. In this paper we introduce the notions of pseudo-surjective and iterable functions (related to free functions of [15]). These two properties imply the hardness of the τ-formulas from the function but unlike the hardness they are preserved under composition and iteration. We link the existence of maps with these two properties to the provability of circuit lower bounds, and we characterize maps g yielding hard τ-formulas in terms of a hitting set type property (all relative to a propositional proof system). We show that a proof system containing EF admits a pseudo-surjective function unless it simulates a proof system WF introduced by Jerabek [11]. an extension of EF. We propose a concrete map g as a candidate function possibly pseudo-surjective or free for strong proof systems. The map is defined as a Nisan-Wigderson generator based on a random function and on a random sparse matrix. We prove that it is iterable in a particular way in resolution, yielding the output/input ratio $n^{3-\varepsilon}$ (that improves upon a direct construction of Alekhnovich et al. [2])
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1080938841
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,803
Through your library
References found in this work BETA
Tautologies From Pseudo-Random Generators.Jan Krajicek - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.

Add more references

Citations of this work BETA
Towards–Via Proof Complexity and Search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
Towards NP-P Via Proof Complexity and Search.Samuel Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.

Add more citations

Similar books and articles
Added to PP index
2009-02-05

Total downloads
172 ( #27,868 of 2,202,777 )

Recent downloads (6 months)
3 ( #97,465 of 2,202,777 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature