Structured Pigeonhole Principle, Search Problems and Hard Tautologies

Journal of Symbolic Logic 70 (2):619 - 630 (2005)
Abstract
We consider exponentially large finite relational structures (with the universe {0.1}ⁿ) whose basic relations are computed by polynomial size (nO(1)) circuits. We study behaviour of such structures when pulled back by P/poly maps to a bigger or to a smaller universe. In particular, we prove that: 1. If there exists a P/poly map g: {0.1} → {0.1}m, n < m, iterable for a proof system then a tautology (independent of g) expressing that a particular size n set is dominating in a size 2ⁿ tournament is hard for the proof system. 2. The search problem WPHP, decoding RSA or finding a collision in a hashing function can be reduced to finding a size m homogeneous subgraph in a size 22m graph. Further we reduce the proof complexity of a concrete tautology (expressing a Ramsey property of a graph) in strong systems to the complexity of implicit proofs of implicit formulas in weak proof systems
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1120224731
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: 29,472
Through your library
References found in this work BETA
Herbrandizing Search Problems in Bounded Arithmetic.Jiří Hanika - 2004 - Mathematical Logic Quarterly 50 (6):577-586.
Lifting Independence Results in Bounded Arithmetic.Mario Chiari & Jan Krajíček - 1999 - Archive for Mathematical Logic 38 (2):123-138.
Tautologies From Pseudo-Random Generators.Jan Krajicek - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Implicit Proofs.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (2):387 - 397.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.
The Cost of a Cycle is a Square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.
Quantum Learning.Ronald Chrisley - 1995 - In P. Pyllkkänen & P. Pyllkkö (eds.), New Directions in Cognitive Science. Finnish Society for Artificial Intelligence.
Added to PP index
2010-08-24

Total downloads
9 ( #494,003 of 2,210,885 )

Recent downloads (6 months)
6 ( #71,197 of 2,210,885 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature