scientific article; zbMATH DE number 2086404

zbMath1054.03035MaRDI QIDQ4736859

Edward A. Hirsch, Dima Yu. Grigoriev, Dimitrii V. Pasechnik

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850419.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (15)

Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Sum of Squares Bounds for the Empty Integral Hull Problem ⋮ Sum-of-squares hierarchy lower bounds for symmetric formulations ⋮ Algebraic proof systems over formulas. ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Unnamed Item ⋮ On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy ⋮ Rank bounds for a hierarchy of Lovász and Schrijver ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight rank lower bounds for the Sherali-Adams proof system ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II ⋮ Size-degree trade-offs for sums-of-squares and positivstellensatz proofs ⋮ MaxSAT Resolution and Subcube Sums

This page was built for publication: