scientific article; zbMATH DE number 4123298

From MaRDI portal
Revision as of 14:32, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.





Related Items (24)

Algorithmic aspects of Suslin's proof of Serre's conjectureOn polynomial ideals, their complexity, and applicationsBounds of traces in complete intersections and degrees in the NullstellensatzLower bounds for diophantine approximationsBounds for the Hilbert function of polynomial ideals and for the degrees in the NullstellensatzPolar varieties, real equation solving, and data structures: the hypersurface caseEffective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n\)] ⋮ Straight-line programs in geometric elimination theoryGeneralised characteristic polynomialsAn incidence theorem in higher dimensionsRecent improvements in the complexity of the effective NullstellensatzEquations for the projective closure and effective NullstellensatzThe membership problem for unmixed polynomial ideals is solvable in single exponential timeAn effective residual criterion for the membership problem in \(\mathbb{C} [z_ 1,\cdots{} ,z_ n\)] ⋮ Time-space tradeoffs in algebraic complexity theoryAn optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroupsA bound for orders in differential NullstellensatzComputing bases of complete intersection rings in Noether positionSur la complexité du principe de Tarski-SeidenbergPrecise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsGood degree bounds on Nullstellensatz refutations of the induction principleComplexity bounds in elimination theory -- a survey.A sparse effective NullstellensatzAn effective algorithm for quantifier elimination over algebraically closed fields using straight line programs







This page was built for publication: