A solution to Kronecker's problem
DOI10.1007/BF01188747zbMath0809.13016MaRDI QIDQ1335137
Bhubaneswar Mishra, Giovanni Gallo
Publication date: 27 September 1994
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
complexityGröbner basesrepresentation problemideal membership problemmultivariate polynomial ringWainer hierarchy
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) 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) Polynomials, factorization in commutative rings (13P05)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound construction for commutative Thue systems with applications
- On the construction of Gröbner bases using syzygies
- On constructing bases for ideals in polynomial rings over the integers
- On the complexity of computing syzygies
- Notes on Gröbner bases
- A solution to Kronecker's problem
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The solution of a decision problem for several classes of rings
- What is Noetherian?
- Ideals inZ[x, y]
- Dedekind's Invention of Ideals
- A classification of the ordinal recursive functions
- Constructive Aspects of Noetherian Rings
- A Canonical Basis for the Ideals of a Polynomial Domain
This page was built for publication: A solution to Kronecker's problem