scientific article; zbMATH DE number 4092769

MaRDI QIDQ3820004zbMATH OpenFDO

Authors Dima Grigoriev

Publication date 1987

zbMATH Keywords

computational complexitycomputer algebrapolynomial algebrapolynomial equations

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 66626
• scientific article; zbMATH DE number 976329
• Polynomial algorithms in computer algebra
• scientific article; zbMATH DE number 806911
• On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae

Cited in

(17)

• Algebraic complexity of computing polynomial zeros
• Solving systems of polynomial inequalities in subexponential time
• Complexity of deciding Tarski algebra
• Computation in polynomial algebras and ideals
• Polynomial algorithms in computer algebra
• Loewy and primary decompositions of D-modules
• Weak Bézout inequality for D-modules
• Systole length in hyperbolic \(n\)-manifolds
• scientific article; zbMATH DE number 3932433 (Why is no real title available?)
• scientific article; zbMATH DE number 4096783 (Why is no real title available?)
• scientific article; zbMATH DE number 66626 (Why is no real title available?)
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• Algorithmic Polynomials
• Algorithmic polynomials
• scientific article; zbMATH DE number 2221549 (Why is no real title available?)
• Universal stratifications and a Bertini-type theorem
• Complexity of factoring and calculating the GCD of linear ordinary differential operators

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 Q3820004)