A complexity gap for tree resolution

@article{Riis2001ACG,
  title={A complexity gap for tree resolution},
  author={S\oren Riis},
  journal={computational complexity},
  year={2001},
  volume={10},
  pages={179-209}
}
This paper shows that any sequence $ \psi_ n $ of tautologies which expresses the validity of a fixed combinatorial principle either is “easy”, i.e. has polynomial size tree-resolution proofs, or is “difficult”, i.e. requires exponential size tree-resolution proofs. It is shown that the class of tautologies which are hard (for tree resolution) is identical to the class of tautologies which are based on combinatorial principles which are violated for infinite sets. Further it is shown that the… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 36 extracted citations

Resolution and pebbling games

Electronic Colloquium on Computational Complexity • 2004
View 6 Excerpts
Highly Influenced

Resolution and the binary encoding of combinatorial principles

Electronic Colloquium on Computational Complexity • 2018
View 6 Excerpts
Highly Influenced

The Riis Complexity Gap for QBF Resolution

Electronic Colloquium on Computational Complexity • 2018
View 12 Excerpts
Highly Influenced

Parameterized Proof Complexity and W[1]

ArXiv • 2012
View 4 Excerpts
Highly Influenced

Cutting Planes and the Parameter Cutwidth

Theory of Computing Systems • 2011
View 5 Excerpts
Highly Influenced

Parameterized Proof Complexity

computational complexity • 2010
View 9 Excerpts
Highly Influenced

The treewidth of proofs

Inf. Comput. • 2017
View 3 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Independence in Bounded Arithmetic

S. Riis
DPhil dissertation, Oxford Univ. • 1993
View 15 Excerpts
Highly Influenced

The Complexity of the Pigeonhole Principle

Combinatorica • 1994
View 4 Excerpts
Highly Influenced

Orders of Infinity, Cambridge Univ

G. H. Hardy
Press, 3rd ed. W. Hodges (1993). Model Theory, Encyclopedia Math. Appl. 42, Cambridge Univ. Press. M. J. Kearns & U. V. Vazirani (1994). An Introduction to Computational Learning Theory. MIT Press. • 1954
View 4 Excerpts
Highly Influenced

Making infinite structures finite in models of Second Order Bounded Arithmetic

P. Pudlák
Proofs as games. Amer. Math. Monthly • 2000
View 3 Excerpts
Highly Influenced

Introduction to Proof Theory

J. Sergal
Handbook of Proof Theory • 1998

A complexity gap for tree resolution

S. Riis
Ann. Pure Appl. Logic • 1997
View 3 Excerpts

Count( qq) versus the pigeon-hole principle

Arch. Math. Log. • 1997
View 3 Excerpts

Similar Papers

Loading similar papers…