Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
暂无分享,去创建一个
[1] Samuel R. Buss,et al. Resolution Proofs of Generalized Pigeonhole Principles , 1988, Theor. Comput. Sci..
[2] J. Kraj. On the Weak Pigeonhole Principle , 2001 .
[3] J. Krajícek. On the weak pigeonhole principle , 2001 .
[4] Toniann Pitassi,et al. A new proof of the weak pigeonhole principle , 2000, STOC '00.
[5] G. Grimmett,et al. Probability and random processes , 2002 .
[6] Jan Krajícek,et al. Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.
[7] Ran Raz,et al. Regular resolution lower bounds for the weak pigeonhole principle , 2001, STOC '01.
[8] Jeff B. Paris,et al. Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes , 1988, J. Symb. Log..
[9] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.
[10] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.
[11] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[12] Toniann Pitassi,et al. Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[13] Michael E. Saks,et al. The Efficiency of Resolution and Davis--Putnam Procedures , 2002, SIAM J. Comput..
[14] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.
[15] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[16] Samuel R. Buss,et al. Resolution and the Weak Pigeonhole Principle , 1997, CSL.
[17] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..