Some complexity results for polynomial ideals

DOI10.1006/JCOM.1997.0447zbMATH Open1033.12008OpenAlexW1988821632MaRDI QIDQ1296522FDOQ1296522

Publication date: 2 August 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1997.0447

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

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cited In (36)

Polynomially computable structures with finitely many generators
Groebner basis methods for multichannel sampling with unknown offsets
Dehn functions of finitely presented metabelian groups
Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory
Numerical homotopies to compute generic points on positive dimensional algebraic sets
Computing dimension and independent sets for polynomial ideals
Title not available (Why is that?)
Sparse effective membership problems via residue currents
Interpolation of ideals
Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties
On the parallel complexity of the polynomial ideal membership problem
Title not available (Why is that?)
Title not available (Why is that?)
Complexity of Membership Problems of Different Types of Polynomial Ideals
On the complexity of counting components of algebraic varieties
Finding multiple Nash equilibria via machine learning-supported Gröbner bases
Binomial fibers and indispensable binomials
Subexponential-time computation of isolated primary components of a polynomial ideal
Title not available (Why is that?)
Title not available (Why is that?)
Deterministically Computing Reduction Numbers of Polynomial Ideals
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Title not available (Why is that?)
Verification complexity of linear prime ideals
Title not available (Why is that?)
Convex integer maximization via Graver bases
Macaulay-like marked bases
On the robust hardness of Gröbner basis computation
Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
Finitely generated structures computable in polynomial time
Title not available (Why is that?)
Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
Searching for applicable versions of computable structures
On polynomial ideals, their complexity, and applications

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)