Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem - MaRDI portal

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

From MaRDI portal

Publication:4973862

Jump to:navigation, search

DOI10.1145/2903266zbMath1427.03064OpenAlexW2429630190WikidataQ61732575 ScholiaQ61732575MaRDI QIDQ4973862

Massimo Lauria

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2903266

zbMATH Keywords

integer programming Ramsey theory rank cutting planes proof complexity

Mathematics Subject Classification ID

Integer programming (90C10) Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4973862&oldid=19409628"