A solution to Kronecker's problem
From MaRDI portal
complexity[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]representation 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)
Recommendations
- On a Solution Of Kesten’s Problem
- Publication:4504560
- SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR
- scientific article; zbMATH DE number 1293534
- The solution of the Kadison-Singer problem
- The solution of the Kadison-Singer problem
- An Algorithm to Solve the Frobenius Problem
- On the Kronecker problem and related problems of linear algebra
- A solution of the Ehrenpreis factorization problem
Cites work
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 3899033 (Why is no real title available?)
- scientific article; zbMATH DE number 4069044 (Why is no real title available?)
- scientific article; zbMATH DE number 3614780 (Why is no real title available?)
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- scientific article; zbMATH DE number 3266719 (Why is no real title available?)
- A Canonical Basis for the Ideals of a Polynomial Domain
- A classification of the ordinal recursive functions
- A new lower bound construction for commutative Thue systems with applications
- A solution to Kronecker's problem
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Constructive Aspects of Noetherian Rings
- Dedekind's Invention of Ideals
- Ideals inZ[x, y]
- Notes on Gröbner bases
- On constructing bases for ideals in polynomial rings over the integers
- On the complexity of computing syzygies
- On the construction of Gröbner bases using syzygies
- 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?
Cited in
(7)- A concise proof of the Kronecker polynomial system solver from scratch
- Automorphisms mapping a point into a subvariety
- Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
- A solution to Kronecker's problem
- Dynamical Gröbner bases
- 2000-2001 Winter Meeting of the Association for Symbolic Logic. Sheraton New Orleans Hotel, New Orleans, Louisiana, January 12-13, 2001
- Ideal membership in polynomial rings over the integers
This page was built for publication: A solution to Kronecker's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335137)
