Degree complexity for a modified pigeonhole principle
暂无分享,去创建一个
[1] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.
[2] Russell Impagliazzo,et al. Lower bounds for the polynomial calculus and the Gröbner basis algorithm , 1999, computational complexity.
[3] Russell Impagliazzo,et al. Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.
[4] Andreas Goerdt. Unrestricted Resolution versus N-Resolution , 1992, Theor. Comput. Sci..
[5] Alexander A. Razborov,et al. Lower bounds for the polynomial calculus , 1998, computational complexity.
[6] Samuel R. Buss,et al. Linear gaps between degrees for the polynomial calculus modulo distinct primes , 1999, STOC '99.