Recommendations
Cites work
- (Semi)Algebraic proofs over {±1} variables
- A Complete Calculus for Max-SAT
- Circular (yet sound) proofs
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Equivalence between systems stronger than resolution
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases
- Handbook of satisfiability. In 2 parts
- Hard examples for resolution
- scientific article; zbMATH DE number 1256733 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
- Lower bounds for the polynomial calculus
- Nullstellensatz-proofs for multiplier verification
- On tackling the limits of resolution in SAT solving
- On the power of clause-learning SAT solvers as resolution engines
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Polynomial calculus for MaxSAT
- Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
- Propositional proof systems based on maximum satisfiability
- Resolution for Max-SAT
- The power of negative reasoning
- The relative efficiency of propositional proof systems
- Towards a better understanding of (partial weighted) MaxSAT proof systems
This page was built for publication: Polynomial calculus for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665696)
