Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

01/08/2020
by   Susanna F. de Rezende, et al.
0

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.

READ FULL TEXT
research
10/23/2019

Analyzing Trade-offs in Reversible Linear and Binary Search Algorithms

Reversible algorithms are algorithms in which each step represents a par...
research
11/04/2018

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

We show that if a system of degree-k polynomial inequalities on n Boolea...
research
12/08/2017

Graph-based time-space trade-offs for approximate near neighbors

We take a first step towards a rigorous asymptotic analysis of graph-bas...
research
07/17/2018

RiffleScrambler - a memory-hard password storing function

We introduce RiffleScrambler: a new family of directed acyclic graphs an...
research
09/12/2019

Learning Graphs from Linear Measurements: Fundamental Trade-offs and Applications

We consider a specific graph learning task: reconstructing a symmetric m...
research
11/09/2019

The Bias-Expressivity Trade-off

Learning algorithms need bias to generalize and perform better than rand...
research
06/09/2022

Principal Trade-off Analysis

This paper develops Principal Trade-off Analysis (PTA), a decomposition ...

Please sign up or login with your details

Forgot password? Click here to reset