scientific article

From MaRDI portal
Publication:3002766

DOI10.4086/toc.2006.v002a004zbMath1213.68328OpenAlexW153015188MaRDI QIDQ3002766

Avner Magen, Shlomo Hoory, Toniann Pitassi, Nicola Galesi, Joshua Buresh-Oppenheim

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2006.v002a004

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



Related Items (23)

Rank of random half-integral polytopes — extended abstract —Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical MachinesAn explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphsUnnamed ItemThe limits of tractability in resolution-based propositional proof systemsOn polytopes with linear rank with respect to generalizations of the split closureDepth lower bounds in Stabbing Planes for combinatorial principlesExpander graphs and their applicationsRank complexity gap for Lovász-Schrijver and Sherali-Adams proof systemsTowards strong nonapproximability results in the Lovász-Schrijver hierarchyRank bounds for a hierarchy of Lovász and SchrijverIntegrality Gaps of Linear and Semi-Definite Programming Relaxations for KnapsackCutting Planes and the Parameter CutwidthCutting planes and the parameter cutwidthResolution Width and Cutting Plane Rank Are IncomparableThe Complexity of Propositional ProofsExponential Lower Bounds for Polytopes in Combinatorial OptimizationConvex Relaxations and Integrality GapsSemidefinite and linear programming integrality gaps for scheduling identical machinesUncapacitated flow-based extended formulationsTight rank lower bounds for the Sherali-Adams proof systemOn the Chvátal rank of the pigeonhole principleSuperlinear Integrality Gaps for the Minimum Majority Problem




This page was built for publication: