Computational aspects of the coordinate ring of an algebraic variety

DOI10.1080/00927879008824044zbMath0716.13019OpenAlexW2155677844MaRDI QIDQ3203128

Alessandro Logar

Publication date: 1990

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927879008824044

zbMATH Keywords

arithmetics of the coordinate ringideal theoretic computations

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Relevant commutative algebra (14A05)

Related Items (2)

An algorithm for the Quillen-Suslin theorem for monoid rings ⋮ Algorithms for the Quillen-Suslin theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability and fast quantifier elimination in algebraically closed fields
• New constructive methods in classical ideal theory
• Gröbner bases and primary decomposition of polynomial ideals
• On the complexity of computing syzygies
• The Gröbner fan of an ideal
• Computing combinatorial decompositions of rings
• Algorithms for the Quillen-Suslin theorem
• Serre's conjecture
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Constructive normalization of an algebraic variety
• Construction of the integral closure of a finite integral domain

This page was built for publication: Computational aspects of the coordinate ring of an algebraic variety