An Extension of Strassen’s Degree Bound
From MaRDI portal
Publication:3930631
DOI10.1137/0210026zbMath0475.68017MaRDI QIDQ3930631
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210026
lower bounds; polynomial evaluation; arithmetic complexity; Bezout inequality; polynomials hard to compute
68Q25: Analysis of algorithms and problem complexity
11C08: Polynomials in number theory
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
Definability and fast quantifier elimination in algebraically closed fields, On the order of approximation in approximative triadic decompositions of tensors, The complexity of partial derivatives, Test complexity of generic polynomials, Semi-algebraic decision complexity, the real spectrum, and degree