Polynomial-size Frege and Resolution Proofs of st-Connectivity and Hex Tautologies

Polynomial-size Frege and Resolution Proofs of st-Connectivity and Hex Tautologies (2003)

Cached

Download Links

by Samuel R. Buss

Venue:	Theorectical Computer Science
Citations:	10 - 0 self

BibTeX

@ARTICLE{Buss03polynomial-sizefrege,
    author = {Samuel R. Buss},
    title = {Polynomial-size Frege and Resolution Proofs of st-Connectivity and Hex Tautologies},
    journal = {Theorectical Computer Science},
    year = {2003},
    volume = {357},
    pages = {2006}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

A grid graph has rectangularly arranged vertices with edges permitted only between orthogonally adjacent vertices. The st-connectivity principle states that it is not possible to have a red path of edges and a green path of edges which connect diagonally opposite corners of the grid graph unless the paths cross somewhere.

Citations

285	The Relative Efficiency of Propositional Proof Systems - Cook, Reckhow - 1979
117	Exponential lower bounds for the pigeonhole principle - Beame, Impagliazzo, et al. - 1992
64	An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle, Random Structures and Algorithms - Krajíček, Pudlák, et al. - 1995
63	Polynomial size proofs of the propositional pigeonhole principle. Journal of Symbolic Logic 52 - Buss - 1987
59	Lower bounds on Hilbert’s Nullstellensatz and propositional proofs - Beame, Impagliazzo, et al. - 1996
54	The relative complexity of NP search problems - Beame, Cook, et al. - 1998
50	Reckhow, The relative eciency of propositional proof systems - Cook, A - 1979
48	Lower bounds to the size of constant-depth propositional proofs - Krajíček - 1994
44	On Interpolation and Automatization For Frege Systems - Bonet, Pitassi, et al.
31	Proof complexity in algebraic systems and bounded depth Frege systems with modular counting - Buss, Impagliazzo, et al.
29	On graph-theoretic lemmata and complexity classes - Papadimitriou - 1990
27	The independence of the modulo p counting principle - Ajtai - 1994
27	Linear gaps between degrees for the polynomial calculus modulo distinct primes - Buss, Grigoriev, et al. - 1999
22	Searching Constant Width Mazes Captures the AC 0 Hierarchy - Barrington, Lu, et al. - 1998
17	Cutting planes, connectivity, and threshold logic - Buss, Clote
12	Hex strategy: making the right connections - Browne
11	An exponential separation between the parity principle and the pigeonhole principle - Beame, Pitassi - 1996
11	i cek, Lower bounds to the size of constant-depth propositional proofs - Kraj'
11	Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms 7(1 - cek, ak, et al. - 1995
7	Propositional Calculus and Complexity Theory - Arithmetic - 1995
5	Hex example. Email correspondence, Toronto theory group - Urquhart - 2001
3	Unpublished course notes - Cook, Rackoff - 1997
3	The game of Hex and the Brower fixed-point theorem - Gale - 1979