Computational complexity of polynomial subalgebras

DOI10.1145/3747199.3747578MaRDI QIDQ7288987zbMATH OpenFDO

Authors Elisabeth Leonie Kayser

Publication date 1 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3747199.3747578

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• \texttt{SubalgebraBases} in Macaulay2
• Algorithmic meta theorems for circuit classes of constant and logarithmic depth
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Computational Complexity
• Dimension-dependent bounds for Gröbner bases of polynomial ideals
• Elimination ideals and Bézout relations
• Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
• Modern computer algebra
• On the complexity of computing syzygies
• On the question of finitely many steps in the theory of polynomial ideals. (With the use of posthumous theorems by K. Hentzelt).
• Parallel computation for well-endowed rings and space-bounded probabilistic machines
• Some complexity results for polynomial ideals
• The complexity of satisfiability problems
• The complexity of the word problems for commutative semigroups and polynomial ideals
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• The Structure of Polynomial Ideals and Gröbner Bases
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence

Cited in

(1)

• Efficient descriptions of univariate polynomial subalgebras and their initial algebras

This page was built for publication: Computational complexity of polynomial subalgebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288987)