scientific article; zbMATH DE number 865572
From MaRDI portal
zbMath0868.12008MaRDI QIDQ4872788
Frédéric Smietanski, Marc Giusti, Noaï Fitchas
Publication date: 19 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel complexityprobabilistic algorithmsequential complexityarithmetic algorithmsarithmetic networkcompletely reduced intersection varietycomplexity of the Nullstellensatzeffective infinite commutative fieldevaluation calculus
Analysis of algorithms and problem complexity (68Q25) Computational aspects of higher-dimensional varieties (14Q15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Relevant commutative algebra (14A05) Distributed algorithms (68W15)
Related Items
A global view of residues in the torus, Lower bounds for diophantine approximations, Straight-line programs in geometric elimination theory, Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics, A concise proof of the Kronecker polynomial system solver from scratch, Bezoutian and quotient ring structure, Residue calculus and applications, 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 algorithm for implicit interpolation, Matrices in elimination theory, 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
