A complexity gap for tree resolution

Computational Complexity

Volumn 10, Issue 3, 2001, Pages 179-209

  Riis, Søren ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Logical aspects of complexity; Propositional proof complexity; Resolution proofs

Indexed keywords

EID: 0035739454     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-001-8194-y     Document Type: Article

References (40)

1. M. AJTAI (1988). The complexity of the pigeonhole principle. In 29th Annual Symposium on Foundations of Computer Science, IEEE, 346-355.
2. M. AJTAI (1994a). The complexity of the pigeonhole principle. Combinatorica 14, 417-433.
3. M. AJTAI (1994b). The independence of the modulo p counting principles. In Proc. 26th ACM STOC, 402-411.
4. P. BEAME, R. IMPAGLIAZZO, J. KRAJÍČEK, T. PITASSI & P. PUDLÁK (1996). Lower bounds on Hilbert's Nullstellensatz and propositional proofs. Proc. London Math. Soc. 73, 1-26.
5. P. BEAME, R. IMPAGLIAZZO, J. KRAJÍČEK, T. PITASSI, P. PUDLÁK & A. WOODS (1992). Exponential lower bounds for the pigeonhole principle. In Proc. 24th ACM STOC, 200-221.
6. P. BEAME, R. KARP, T. PITASSI & M. SAKS (1998). On the complexity of unsatisfiability proofs for random k-CNF formulas. In STOC 98, 561-571.
7. P. BEAME & S. RIIS (1996). More on the relative strength of counting principles. In: Proc. DIMACS Workshop on Feasible Arithmetic and Complexity of Proofs, 13-35.
8. S. Buss (1987). The propositional pigeonhole principle has polynomial size Frege proofs, J. Symbolic Logic 52, 916-927.
9. S. Buss (1991). Propositional consistency proofs, Ann. Pure Applied Logic 52, 3-29.
10. S. BUSS (1998). Introduction to Proof Theory. In Handbook of Proof Theory, S. Buss (ed.), Elsevier, 1-78.
11. S. Buss, J. KRAJÍČEK, T. PITASSI, A. RAZBOROV & J. SERGAL (1997). Polynomial bound on Nullstellensatz for counting principles. To appear in Comput. Complexity.
12. S. Buss & T. PITASSI (2000). Resolution and the weak Pigeonhole Principle. Notes.
13. S. COOK & R. RECKHOW (1979). The relative efficiency of propositional proof systems, J. Symbolic Logic 44, 36-50.
14. J. CRAWFORD & L. AUTON (1996). Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81, 31-57.
15. S. DANTCHEV & S. RIIS (2000). Planar tautologies are hard for Resolution. http://www.dcs.qmw.ac.uk/ smriis/planar.ps
16. Z. GALIL (1977). On the complexity of regular resolution and the Davis-Putnam procedure. Theoret. Comput. Sci. 4, 23-46.
17. A. HAKEN (1985). The intractability of resolution. Theoret. Comput. Sci. 39, 297-308.
18. G. H. HARDY (1954). Orders of Infinity, Cambridge Univ. Press, 3rd ed.
19. W. HODGES (1993). Model Theory, Encyclopedia Math. Appl. 42, Cambridge Univ. Press.
20. M. J. KEARNS & U. V. VAZIRANI (1994). An Introduction to Computational Learning Theory. MIT Press.
21. J. KRAJÍČEK (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Encyclopedia Math. Appl. 60, Cambridge Univ. Press.
22. J. KRAJÍČEK (2001). On the degree of ideal membership proofs from uniform families of polynomials over a finite field. Illinois J. Math. 45, 41-73.
23. G. KREISEL & J.-L. KRIVINE (1971). Elements of Mathematical Logic: Model Theory. Revised second ed., Stud. Logic Found. Math., North-Holland.
24. A. LEITSCH (1997). The Resolution Calculus. Texts in Theoret. Comput. Sci., Springer.
25. L. LOVÁSZ, M. NAOR, I. NEWMAN & A. WIGDERSON (1991). Search problems in the decision tree model. In Proc. 32th ACM STOC, 576-585.
26. P. PUDLÁK (1986). On the length of proofs of finitistic consistency statements in first order theories. In Logic Colloquium '84, J. B. Paris et al. (eds.), North-Holland, 165-196.
27. P. PUDLÁK (1987). Improved bounds to the lengths of proofs of finitistic consistency statements. In Logic and Combinatorics, Contemp. Math. 65, Amer. Math. Soc., 309-331.
28. P. PUDLÁK (2000). Proofs as games. Amer. Math. Monthly 107, 541-550.
29. S. RIIS (1993a). Making infinite structures finite in models of Second Order Bounded Arithmetic. In Arithmetic, Proof Theory and Computational Complexity, Oxford Univ. Press, 289-319.
30. S. RIIS (1993b). Independence in Bounded Arithmetic. DPhil dissertation, Oxford Univ.
31. S. RIIS (1997a). Count(q) does not imply Count(p). Ann. Pure Appl. Logic 90, 1-56.
32. S. RIIS (1997b). Count(q) versus the pigeonhole principle. Arch. Math. Logic 36, 157-188.
33. S. RIIS (1999). A complexity gap for tree-resolution. Technical report BRICS RS-99-29.
34. S. RIIS & M. SITHARAM (2000). Generating hard tautologies using logic and the symmetric group. Logic J. IGPL 8, 787-795.
35. S. RIIS & M. SITHARAM (2001). Uniformly generated submodules of permutation modules. J. Pure Appl. Algebra 160, 285-318.
36. S. SIMPSON (1987). Unprovable theorem and fast-growing functions. In Logic and Combinatorics (Arcata, CA, 1985), Contemp. Math. 65, 359-394.
37. G. S. TSEǏTIN (1968). On the complexity of derivations in the propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic. II, A. O. Slisenko (ed.), Zap. Nauchn. Sem. LOMI 8, 234-259 (in Russian).
38. A. URQUHART (1987). Hard examples for resolution. J. Assoc. Comput. Mach. 34, 209-219.
39. A. URQUHART (1995). The complexity of propositional proofs. Bull. Symbolic Logic 1, 425-467.
40. A. URQUHART (2000). Riis's complexity gap for tree resolution. Distributed notes.