Some complexity results for polynomial ideals
From MaRDI portal
Recommendations
- On polynomial ideals, their complexity, and applications
- Complexity of membership problems of different types of polynomial ideals
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
Cited in
(41)- The complexity of the ideal membership problem for constrained problems over the Boolean domain
- scientific article; zbMATH DE number 1759464 (Why is no real title available?)
- Groebner basis methods for multichannel sampling with unknown offsets
- Polynomially computable structures with finitely many generators
- A representation of finite, positive, commutative tomonoids
- Verification complexity of linear prime ideals
- On the parallel complexity of the polynomial ideal membership problem
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- Searching for applicable versions of computable structures
- Finitely generated structures computable in polynomial time
- scientific article; zbMATH DE number 79276 (Why is no real title available?)
- scientific article; zbMATH DE number 3937298 (Why is no real title available?)
- The ideal membership problem and polynomial identity testing
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Dehn functions of finitely presented metabelian groups
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Computing dimension and independent sets for polynomial ideals
- On the complexity of counting components of algebraic varieties
- Complexity of membership problems of different types of polynomial ideals
- Binomial fibers and indispensable binomials
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- On polynomial ideals, their complexity, and applications
- Short proofs of ideal membership
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- scientific article; zbMATH DE number 7561519 (Why is no real title available?)
- scientific article; zbMATH DE number 16653 (Why is no real title available?)
- scientific article; zbMATH DE number 6796098 (Why is no real title available?)
- Convex integer maximization via Graver bases
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Interpolation of ideals
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- scientific article; zbMATH DE number 4017191 (Why is no real title available?)
- Macaulay-like marked bases
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties
- The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory
- On the robust hardness of Gröbner basis computation
- Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- Sparse effective membership problems via residue currents
This page was built for publication: Some complexity results for polynomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296522)
