On polynomial ideals, their complexity, and applications
From MaRDI portal
Publication:5055880
Recommendations
- Some complexity results for polynomial ideals
- Complexity of membership problems of different types of polynomial ideals
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- On the parallel complexity of the polynomial ideal membership problem
- scientific article; zbMATH DE number 1759464
Cites work
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- scientific article; zbMATH DE number 4123298 (Why is no real title available?)
- scientific article; zbMATH DE number 635682 (Why is no real title available?)
- scientific article; zbMATH DE number 1127076 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A new lower bound construction for commutative Thue systems with applications
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- An Algorithm for the General Petri Net Reachability Problem
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Binomial ideals
- Bounds for the degrees in the Nullstellensatz
- Bounds for the degrees in the division problem
- Complexity of parallel matrix computations
- Constructions in Algebra
- Constructive Aspects of Noetherian Rings
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- On the efficiency of effective Nullstellensätze
- Parallelism in random access machines
- Rational sets in commutative monoids
- Recursive unsolvability of a problem of Thue
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Sharp Effective Nullstellensatz
- The Structure of Polynomial Ideals and Gröbner Bases
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
- The complexity of the word problems for commutative semigroups and polynomial ideals
Cited in
(11)- scientific article; zbMATH DE number 1759464 (Why is no real title available?)
- Verification complexity of linear prime ideals
- scientific article; zbMATH DE number 79276 (Why is no real title available?)
- scientific article; zbMATH DE number 3937298 (Why is no real title available?)
- Computing dimension and independent sets for polynomial ideals
- Computation in polynomial algebras and ideals
- Complexity of membership problems of different types of polynomial ideals
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- On a combinatorial theorem of Macaulay and its applications to the theory of polynomial ideals
- The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
This page was built for publication: On polynomial ideals, their complexity, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055880)
