scientific article; zbMATH DE number 2086627
From MaRDI portal
Publication:4737162
zbMath1056.03037MaRDI QIDQ4737162
Edward A. Hirsch, Dima Yu. Grigoriev, Dimitrii V. Pasechnik
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800257.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (3)
Tight size-degree bounds for sums-of-squares proofs ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling
This page was built for publication:
