当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
arXiv - CS - Computational Complexity Pub Date : 2020-01-08 , DOI: arxiv-2001.02481
Susanna F. de Rezende, Or Meir, Jakob Nordstr\"om, Robert Robere

We establish an exactly tight relation between reversible pebblings 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 formula over $G$ in size $t+1$ and degree $s$ (independently of the field in which the Nullstellensatz refutation is made). We use this correspondence to prove a number of strong size-degree trade-offs for Nullstellensatz, which to the best of our knowledge are the first such results for this proof system.

中文翻译:

Nullstellensatz 大小与可逆 Pebbling 的权衡

我们在图的可逆 pebblings 和 pebbling 公式的 Nullstellensatz 反驳之间建立了严格的关系,这表明图 $G$ 可以在时间 $t$ 和空间 $s$ 上可逆 pbbled,当且仅当存在 Nullstellensatz 反驳大小为 $t+1$ 和度数为 $s$ 的 $G$ 上的卵石公式(独立于进行 Nullstellensatz 反驳的领域)。我们使用这种对应关系来证明 Nullstellensatz 的许多强大小度权衡,据我们所知,这是该证明系统的第一个此类结果。
更新日期:2020-01-09
down
wechat
bug