Linear gaps between degrees for the polynomial calculus modulo distinct primes

Authors:
Sam Buss;Dima Grigoriev;Russell Impagliazzo;Toniann Pitassi
Affiliations:
Department of Mathematics, Univ. of Calif., San Diego, La Jolla, CA;Computer Science and Engineering, Pennsylvania State University, University Park, PA;Computer Science and Engineering, Univ. of Calif., San Diego, La Jolla, CA;Computer Science, University of Arizona, Tucson, AZ
Venue:
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Year:
1999

Hard examples for bounded depth frege

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Random CNF's are Hard for the Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hard examples for the bounded depth Frege proof system

Computational Complexity
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

SIAM Journal on Computing
Strong ETH holds for regular resolution

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Hi-index	0.00