On polynomial ideals, their complexity, and applications

DOI10.1007/3-540-60249-6_42OpenAlexW1867119118MaRDI QIDQ5055880FDOQ5055880

Authors: Ernst W. Mayr 

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_42

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Rational sets in commutative monoids
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Binomial ideals
• The Structure of Polynomial Ideals and Gröbner Bases
• Title not available (Why is that?)
• On the efficiency of effective Nullstellensätze
• Title not available (Why is that?)
• Recursive unsolvability of a problem of Thue
• Parallelism in random access machines
• Sharp Effective Nullstellensatz
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Constructions in Algebra
• An Algorithm for the General Petri Net Reachability Problem
• Bounds for the degrees in the Nullstellensatz
• Constructive Aspects of Noetherian Rings
• Title not available (Why is that?)
• Complexity of parallel matrix computations
• Membership in polynomial ideals over Q is exponential space complete
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• A new lower bound construction for commutative Thue systems with applications
• Bounds for the degrees in the division problem
• Title not available (Why is that?)
• Resolution of singularities of an algebraic variety over a field of characteristic zero. II
• The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
• Title not available (Why is that?)

Cited In (8)

• On a combinatorial theorem of Macaulay and its applications to the theory of polynomial ideals
• Computing dimension and independent sets for polynomial ideals
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
• Verification complexity of linear prime ideals
• Title not available (Why is that?)
• Computation in polynomial algebras and ideals

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)