MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Proof Complexity of Pigeonhole Principles." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Proof complexity of pigeonhole principles
by Er A. Razborov — 2002 — In Proceedings of the Fifth International Conference on Developments in Language Theory
…Proof Complexity of Pigeonhole Principles Alexander A. Razborov ⋆ Steklov Mathematical Institute…
Cited by 7 (1 self) – Add To MetaCart

P != NP , Propositional Proof Complexity, and Resolution Lower Bounds for the Weak Pigeonhole
by Ran Raz, Ran Raz — 2002 — in Proceedings of ICM’2002 (International Congress of Mathematicians), Vol. III
… is occupied. For a recent survey on the propositional proof complexity of the pigeonhole principle, see [16…
Cited by 2 (0 self) – Add To MetaCart

Bounded-depth Frege lower bounds for weaker pigeonhole principles
by Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal — 2005 — SIAM JOURNAL ON COMPUTING
… on the proof complexity of pigeonhole principles.) It can be formalized as a propositional formula, denoted…
Cited by 3 (0 self) – Add To MetaCart

Pseudorandom Generators Hard for k-DNF Resolution and Polynomial Calculus Resolution
by Alexander A. Razborov — 2003
… personages in proof complexity as the pigeonhole principle and Tseitin tautologies. Elaborating…
Cited by 29 (3 self) – Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB