Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Parallel Complexity Graphs and Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cumulative Space in Black-White Pebbling and Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-degree trade-offs for sums-of-squares and positivstellensatz proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow Proofs May Be Maximally Long / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity Meets Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some trade-off results for polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Space Tradeoffs for Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5769706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and space bounds for reversible simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogenization and the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity in algebraic systems and bounded depth Frege systems with modular counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good degree bounds on Nullstellensatz refutations of the induction principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme time-space tradeoffs for graphs with small space requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5497120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight rank lower bounds for the Sherali-Adams proof system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nullstellensatz size-degree trade-offs from reversible pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Proofs of Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pebbling Problem is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adventures in monotone complexity and TFNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus and the Gröbner basis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling meets coloring: reversible pebble game on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and space complexity of reversible pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs between size and degree in polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible space equals deterministic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and adiabatic computation: trading time and space for energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified way of proving trade-off results for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Strength of Pebbling and Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble Games, Proof Complexity, and Time-Space Trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly exponential lower bounds for monotone computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Nullstellensatz to monotone span programs over any field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Register Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs on the FFT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time tradeoffs for linear recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space / rank
 
Normal rank

Latest revision as of 05:48, 26 July 2024

scientific article
Language Label Description Also known as
English
Nullstellensatz size-degree trade-offs from reversible pebbling
scientific article

    Statements

    Nullstellensatz size-degree trade-offs from reversible pebbling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2021
    0 references
    0 references
    proof complexity
    0 references
    nullstellensatz
    0 references
    trade-offs
    0 references
    pebbling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references