Abstract
We establish an exactly tight relation between reversiblepebblings of graphs and Nullstellensatz refutations of pebbling formulas,showing that a graph G can be reversibly pebbled in time t and space s if and only if there is a Nullstellensatz refutation of the pebbling formulaover G in size t + 1 and degree s (independently of the field in whichthe Nullstellensatz refutation is made). We use this correspondenceto prove a number of strong size-degree trade-offs for Nullstellensatz,which to the best of our knowledge are the first such results for thisproof system.
| Original language | English |
|---|---|
| Article number | 4 |
| Journal | Computational Complexity |
| Volume | 30 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jun 2021 |
Bibliographical note
Publisher Copyright:© 2021, Springer Nature Switzerland AG.
Keywords
- 68Q17
- Nullstellensatz
- Pebbling
- Proof complexity
- Trade-offs
ASJC Scopus subject areas
- Theoretical Computer Science
- General Mathematics
- Computational Theory and Mathematics
- Computational Mathematics
Fingerprint
Dive into the research topics of 'Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling'. Together they form a unique fingerprint.Related research output
- 1 Conference contribution
-
Nullstellensatz size-degree trade-offs from reversible pebbling
De Rezende, S. F., Nordström, J., Meir, O. & Robere, R., 1 Jul 2019, 34th Computational Complexity Conference, CCC 2019. Shpilka, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 18:1–18:16 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver