scientific article; zbMATH DE number 5485561
From MaRDI portal
Publication:5302072
zbMath1231.68288MaRDI QIDQ5302072
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
A lower bound for the determinantal complexity of a hypersurface ⋮ On the Expressive Power of Read-Once Determinants ⋮ An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas ⋮ Lower bounds for the determinantal complexity of explicit low degree polynomials ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
This page was built for publication:
