Some complexity results for polynomial ideals
From MaRDI portal
Publication:1296522
DOI10.1006/jcom.1997.0447zbMath1033.12008OpenAlexW1988821632MaRDI QIDQ1296522
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
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Complexity of Membership Problems of Different Types of Polynomial Ideals, Unnamed Item, Finding multiple Nash equilibria via machine learning-supported Gröbner bases, Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties, Binomial fibers and indispensable binomials, On the robust hardness of Gröbner basis computation, Polynomially computable structures with finitely many generators, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Dehn functions of finitely presented metabelian groups, Groebner basis methods for multichannel sampling with unknown offsets, Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory, Macaulay-like marked bases, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, Unnamed Item, Convex integer maximization via Graver bases, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, On the parallel complexity of the polynomial ideal membership problem, On the complexity of counting components of algebraic varieties, Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable, Finitely generated structures computable in polynomial time, Interpolation of ideals, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Searching for applicable versions of computable structures
