Algorithmic aspects of Suslin's proof of Serre's conjecture

DOI10.1007/BF01200406zbMath0824.68049WikidataQ123145380 ScholiaQ123145380MaRDI QIDQ2366722

Joos Heintz, Pablo Solernó, Guillermo Cortiñas, Teresa Krick, Leandro Caniglia, Silvia Danón

Publication date: 30 August 1993

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

Serre's conjecture; sequential complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

Related Items

An algorithm for the Quillen-Suslin theorem for quotients of polnomial rings by monomial ideals, Computing bases of complete intersection rings in Noether position, An algorithm for the Quillen-Suslin theorem for monoid rings, A generic effective Nullstellensatz, Suslin's algorithms for reduction of unimodular rows, An algorithm for unimodular completion over noetherian rings

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• Bounds for the degrees in the Nullstellensatz
• On the complexity of computing syzygies
• Algorithms for the Quillen-Suslin theorem
• Serre's conjecture
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
• Constructions in Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item