scientific article

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

polynomial identities random algorithm complexity of polynomials correct test sequences multivariate polynomial with integer coefficients

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items

Generalized polar varieties: geometry and algorithms ⋮ Computing generators of the ideal of a smooth affine algebraic variety ⋮ Polar varieties, real equation solving, and data structures: the hypersurface case ⋮ Elimination of constants from machines over algebraically closed fields ⋮ Derandomization from Algebraic Hardness ⋮ Deformation techniques to solve generalised Pham systems ⋮ On sets of linear forms of maximal complexity ⋮ Sparse resultants and straight-line programs ⋮ The number of reducible space curves over a finite field ⋮ Variant quantifier elimination ⋮ Lower complexity bounds for interpolation algorithms ⋮ New effective differential Nullstellensatz ⋮ Weak identifiability for differential algebraic systems ⋮ An explicit separation of relativised random polynomial time and relativised deterministic polynomial time ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Computing multihomogeneous resultants using straight-line programs ⋮ Lower bounds against weakly-uniform threshold circuits ⋮ Time-space tradeoffs in algebraic complexity theory ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Improved explicit estimates on the number of solutions of equations over a finite field ⋮ On sign conditions over real multivariate polynomials ⋮ A parametric representation of totally mixed Nash equilibria ⋮ On the complexity of the resolvent representation of some prime differential ideals ⋮ Computing bases of complete intersection rings in Noether position ⋮ Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel ⋮ Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients ⋮ A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density ⋮ Arithmetic Circuits: A Chasm at Depth 3 ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits ⋮ On interpolating arithmetic read-once formulas with exponentiation ⋮ Unnamed Item ⋮ Complexity bounds in elimination theory -- a survey. ⋮ Elimination of parameters in the polynomial hierarchy ⋮ An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs ⋮ The Projective Noether Maple Package: Computing the dimension of a projective variety ⋮ Functional programming concepts and straight-line programs in computer algebra ⋮ Degeneracy loci and polynomial equation solving ⋮ Definability and fast quantifier elimination in algebraically closed fields ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Effective equidimensional decomposition of affine varieties ⋮ Mining circuit lower bound proofs for meta-algorithms ⋮ Unifying known lower bounds via geometric complexity theory