scientific article; zbMATH DE number 1254030

MaRDI QIDQ4227013zbMATH OpenFDO

Authors Agnes Szanto

Publication date 23 February 1999

zbMATH Keywords

characteristic set of polynomialsradicalwell-parallelizable algorithm

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Nonnumerical algorithms (68W05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 16648
• scientific article; zbMATH DE number 4213458
• Prime decompositions of radicals in polynomial rings

Cited in

(12)

• On the complexity of counting components of algebraic varieties
• Complexity of triangular representations of algebraic sets
• Prime decompositions of radicals in polynomial rings
• Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties
• scientific article; zbMATH DE number 4213458 (Why is no real title available?)
• A new bound on Hrushovski's algorithm for computing the Galois group of a linear differential equation
• On a generalization of Stickelberger's theorem
• Persistent components in Canny's generalized characteristic polynomial
• Choosing variable orderings based on elimination tree for sparse triangular decomposition
• Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
• Differential elimination and algebraic invariants of polynomial dynamical systems
• Strongly and transitive chordal graphs and their applications in complexity analysis of triangular decomposition

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227013)