The Power of Negative Reasoning
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Fulltext
Forlagets udgivne version, 760 KB, PDF-dokument
Semialgebraic proof systems have been studied extensively in proof complexity since the late 1990s to understand the power of Gröbner basis computations, linear and semidefinite programming hierarchies, and other methods. Such proof systems are defined alternately with only the original variables of the problem and with special formal variables for positive and negative literals, but there seems to have been no study how these different definitions affect the power of the proof systems. We show for Nullstellensatz, polynomial calculus, Sherali-Adams, and sums-of-squares that adding formal variables for negative literals makes the proof systems exponentially stronger, with respect to the number of terms in the proofs. These separations are witnessed by CNF formulas that are easy for resolution, which establishes that polynomial calculus, Sherali-Adams, and sums-of-squares cannot efficiently simulate resolution without having access to variables for negative literals.
Originalsprog | Engelsk |
---|---|
Titel | 36th Computational Complexity Conference, CCC 2021 |
Redaktører | Valentine Kabanets |
Antal sider | 24 |
Forlag | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publikationsdato | 2021 |
Artikelnummer | 40 |
ISBN (Elektronisk) | 978-3-95977-193-1 |
DOI | |
Status | Udgivet - 2021 |
Begivenhed | 36th Computational Complexity Conference, CCC 2021 - Virtual, Toronto, Canada Varighed: 20 jul. 2021 → 23 jul. 2021 |
Konference
Konference | 36th Computational Complexity Conference, CCC 2021 |
---|---|
Land | Canada |
By | Virtual, Toronto |
Periode | 20/07/2021 → 23/07/2021 |
Navn | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Vol/bind | 200 |
ISSN | 1868-8969 |
Bibliografisk note
Funding Information:
Funding Susanna F. de Rezende was supported by Knut and Alice Wallenberg grant KAW 2018.0371. Jakob Nordström received funding from the Swedish Research Council grant 2016-00782 and the Independent Research Fund Denmark grant 9040-00389B. Part of this work was carried out while visiting the Simons Institute for the Theory of Computing.
Publisher Copyright:
© Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, and Dmitry Sokolov;
ID: 306898812