scientific article; zbMATH DE number 4123298
From MaRDI portal
Publication:4203817
zbMath0685.68044MaRDI QIDQ4203817
Leandro Caniglia, Joos Heintz, Andre Galligo
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37) Discrete mathematics in relation to computer science (68R99)
Related Items
Algorithmic aspects of Suslin's proof of Serre's conjecture, On polynomial ideals, their complexity, and applications, Bounds of traces in complete intersections and degrees in the Nullstellensatz, Lower bounds for diophantine approximations, Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz, Polar varieties, real equation solving, and data structures: the hypersurface case, Effective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n\)], Straight-line programs in geometric elimination theory, Generalised characteristic polynomials, An incidence theorem in higher dimensions, Recent improvements in the complexity of the effective Nullstellensatz, Equations for the projective closure and effective Nullstellensatz, The membership problem for unmixed polynomial ideals is solvable in single exponential time, An effective residual criterion for the membership problem in \(\mathbb{C} [z_ 1,\cdots{} ,z_ n\)], Time-space tradeoffs in algebraic complexity theory, An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups, A bound for orders in differential Nullstellensatz, Computing bases of complete intersection rings in Noether position, Sur la complexité du principe de Tarski-Seidenberg, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, Good degree bounds on Nullstellensatz refutations of the induction principle, Complexity bounds in elimination theory -- a survey., A sparse effective Nullstellensatz, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
