Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs

@inproceedings{Beame1996LowerBO,
  title={Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs},
  author={Paul Beame and Russell Impagliazzo and Jan Kraj{\'i}cek and Toniann Pitassi and Pavel Pudl{\'a}k},
  year={1996}
}

Citations

Publications citing this paper.
SHOWING 1-10 OF 79 CITATIONS

More on the relative strength of counting principles

  • Proof Complexity and Feasible Arithmetics
  • 1996
VIEW 13 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Tight Size-Degree Bounds for Sums-of-Squares Proofs

  • computational complexity
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A reduction of proof complexity to computational complexity for AC 0

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A complexity gap for tree resolution

  • computational complexity
  • 2001
VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Complexity of Positivstellensatz proofs for the knapsack

  • computational complexity
  • 2001
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Descriptive Complexity and Finite Models

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Descriptive complexity of linear equation systems and applications to propositional proof complexity

  • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Parameterized Complexity of DPLL Search Procedures

  • ACM Trans. Comput. Log.
  • 2013
VIEW 2 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1995
2019

CITATION STATISTICS

  • 10 Highly Influenced Citations

Similar Papers

Loading similar papers…