加载中…
We establish an exactly tight relation between reversible pebblings of graphs and Nullstellensatz refutations of pebbling formulas, showing that a graph can be reversibly pebbled in time and space if and only if there is a Nullstellensatz refutation of the pebbling formula over in size and degree (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.

生成讲解博客的中文版本

生成AI智能校验的中文版本