Publication:4872788
From MaRDI portal
zbMath0868.12008MaRDI QIDQ4872788
Marc Giusti, Noaï Fitchas, Frédéric Smietanski
Publication date: 19 August 1997
parallel complexity; probabilistic algorithm; sequential complexity; arithmetic algorithms; arithmetic network; completely reduced intersection variety; complexity of the Nullstellensatz; effective infinite commutative field; evaluation calculus
68Q25: Analysis of algorithms and problem complexity
14Q15: Computational aspects of higher-dimensional varieties
12D10: Polynomials in real and complex fields: location of zeros (algebraic theorems)
14A05: Relevant commutative algebra
68W15: Distributed algorithms
Related Items
Kronecker's and Newton's approaches to solving: a first comparison, A new method to obtain lower bounds for polynomial evaluation, Explicit formulas for the multivariate resultant., Rational formulas for traces in zero-dimensional algebras, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, A global view of residues in the torus, Lower bounds for diophantine approximations, Straight-line programs in geometric elimination theory, The Projective Noether Maple Package: Computing the dimension of a projective variety, Matrices in elimination theory, A concise proof of the Kronecker polynomial system solver from scratch, Bezoutian and quotient ring structure, Residue calculus and applications
