Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Susanna F. De Rezende; Or Meir; Jakob Nordström; Robert Robere

doi:10.1007/s00037-020-00201-y

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Susanna F. De Rezende, Or Meir, Jakob Nordström, Robert Robere

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1007/s00037-020-00201-y
State	Published - Jun 2021

Bibliographical note

Funding Information:
This work was mostly carried out while the authors were visiting the Simons Institute for the Theory of Computing in association with the DIMACS/Simons Collaboration on Lower Bounds in Computational Complexity, which is conducted with support from the National Science Foundation. Or Meir was supported by the Israel Science Foundation (grant No. 1445/16). Robert Robere was supported by NSERC, and also conducted part of this work at DIMACS with support from the National Science Foundation under grant number CCF-1445755. Susanna F. de Rezende and Jakob Nordström were supported by the Knut and Alice Wallenberg grant KAW 2016.0066 Approximation and Proof Complexity. Jakob Nordström was also supported by the Swedish Research Council grant 2016-00782 and by the Independent Research Fund Denmark grant 9040-00389B. A preliminary version (de Rezende et al. 2019) of this work appeared in CCC 2019.

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Keywords

68Q17
Nullstellensatz
Pebbling
Proof complexity
Trade-offs

ASJC Scopus subject areas

Theoretical Computer Science
Mathematics (all)
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1007/s00037-020-00201-y

Cite this

@article{5acc8e3fb9764d52a0d19b6fac2067e6,

title = "Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling",

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.",

keywords = "68Q17, Nullstellensatz, Pebbling, Proof complexity, Trade-offs",

author = "{De Rezende}, {Susanna F.} and Or Meir and Jakob Nordstr{\"o}m and Robert Robere",

note = "Funding Information: This work was mostly carried out while the authors were visiting the Simons Institute for the Theory of Computing in association with the DIMACS/Simons Collaboration on Lower Bounds in Computational Complexity, which is conducted with support from the National Science Foundation. Or Meir was supported by the Israel Science Foundation (grant No. 1445/16). Robert Robere was supported by NSERC, and also conducted part of this work at DIMACS with support from the National Science Foundation under grant number CCF-1445755. Susanna F. de Rezende and Jakob Nordstr{\"o}m were supported by the Knut and Alice Wallenberg grant KAW 2016.0066 Approximation and Proof Complexity. Jakob Nordstr{\"o}m was also supported by the Swedish Research Council grant 2016-00782 and by the Independent Research Fund Denmark grant 9040-00389B. A preliminary version (de Rezende et al. 2019) of this work appeared in CCC 2019. Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.",

year = "2021",

month = jun,

doi = "10.1007/s00037-020-00201-y",

language = "English",

volume = "30",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "1",

}

TY - JOUR

T1 - Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

AU - De Rezende, Susanna F.

AU - Meir, Or

AU - Nordström, Jakob

AU - Robere, Robert

N1 - Funding Information: This work was mostly carried out while the authors were visiting the Simons Institute for the Theory of Computing in association with the DIMACS/Simons Collaboration on Lower Bounds in Computational Complexity, which is conducted with support from the National Science Foundation. Or Meir was supported by the Israel Science Foundation (grant No. 1445/16). Robert Robere was supported by NSERC, and also conducted part of this work at DIMACS with support from the National Science Foundation under grant number CCF-1445755. Susanna F. de Rezende and Jakob Nordström were supported by the Knut and Alice Wallenberg grant KAW 2016.0066 Approximation and Proof Complexity. Jakob Nordström was also supported by the Swedish Research Council grant 2016-00782 and by the Independent Research Fund Denmark grant 9040-00389B. A preliminary version (de Rezende et al. 2019) of this work appeared in CCC 2019. Publisher Copyright: © 2021, Springer Nature Switzerland AG.

PY - 2021/6

Y1 - 2021/6

N2 - 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.

AB - 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.

KW - 68Q17

KW - Nullstellensatz

KW - Pebbling

KW - Proof complexity

KW - Trade-offs

UR - http://www.scopus.com/inward/record.url?scp=85101029418&partnerID=8YFLogxK

U2 - 10.1007/s00037-020-00201-y

DO - 10.1007/s00037-020-00201-y

M3 - Article

AN - SCOPUS:85101029418

SN - 1016-3328

VL - 30

JO - Computational Complexity

JF - Computational Complexity

IS - 1

M1 - 4

ER -

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint