Complexity bounds in elimination theory -- a survey.
type: Item
instance of: scholarly article
title: Complexity bounds in elimination theory -- a survey.
zbMATH Open document ID: 1037.14504
DOI: 10.1016/S0378-4754(96)00017-1
author: Pablo Solernó
published in: Mathematics and Computers in Simulation
publication date: 2003-05-27T00:00:00Z
Mathematics Subject Classification ID: 14Q99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1920704
zbMATH Keywords: computer algebra
zbMATH Keywords: complexity
zbMATH Keywords: straight line program
zbMATH Keywords: algebraic variety
zbMATH Keywords: elimination theory
MaRDI profile type: Publication
cites work: Q3481825
cites work: Bounds for the degrees in the division problem
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Bounds for the degrees in the Nullstellensatz
cites work: Q4204240
cites work: Q4203817
cites work: Q3358853
cites work: The membership problem for unmixed polynomial ideals is solvable in single exponential time
cites work: Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
cites work: Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
cites work: Q4725742
cites work: On the efficiency of effective Nullstellensätze
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: On the intrinsic complexity of elimination theory
cites work: Q3942397
cites work: Q3912021
cites work: Le formalisme du résultant. (The formalism of resultant)
cites work: Greatest common divisors of polynomials given by straight-line programs
cites work: Sharp Effective Nullstellensatz
cites work: Résolution des systèmes d'équations algébriques
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Bounds of traces in complete intersections and degrees in the Nullstellensatz
cites work: Degree bounds for the division problem in polynomial ideals
cites work: On the representation of rational functions of bounded complexity
cites work: Berechnung und Programm. I
cites work: Q5776125
description: scientific article; zbMATH DE number 1920704