Homogenization and the polynomial calculus
From MaRDI portal
Publication:1430569
DOI10.1007/s00037-002-0171-6zbMath1103.68564OpenAlexW2004004688MaRDI QIDQ1430569
Joshua Buresh-Oppenheim, Toniann Pitassi, Russell Impagliazzo, Matthew Clegg
Publication date: 27 May 2004
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-002-0171-6
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items
Polynomially ambiguous probabilistic automata on restricted languages ⋮ Unnamed Item ⋮ The Complexity of Propositional Proofs ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations ⋮ Polynomially Ambiguous Probabilistic Automata on Restricted Languages ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling
This page was built for publication: Homogenization and the polynomial calculus
