Publication:3135191
From MaRDI portal
zbMath0801.68087MaRDI QIDQ3135191
Michael F. Singer, Marek Karpinski, Dima Yu. Grigoriev
Publication date: 29 November 1994
68Q25: Analysis of algorithms and problem complexity
14P05: Real algebraic sets
65D05: Numerical interpolation
Related Items
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Computability of the additive complexity of algebraic circuits with root extracting, Zero testing of \(p\)-adic and modular polynomials, Sparse shifts for univariate polynomials