Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Leibniz International Proceedings in Informatics(2021)

引用 2|浏览27
暂无评分
摘要
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.
更多
查看译文
关键词
Proof complexity, Nullstellensatz, Trade-offs, Pebbling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要