Complexity of computations in Commutative Division of the USSR Academy of Sciences

DOI10.1007/BF01159108zbMath0771.68064MaRDI QIDQ1173942

Dima Yu. Grigoriev

Publication date: 25 June 1992

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

complexity of computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects and applications of commutative rings (13Pxx)

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Résolution des systèmes d'équations algébriques
• Factoring polynomials with rational coefficients
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Constructions in Algebra
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of computations in Commutative Division of the USSR Academy of Sciences