scientific article
From MaRDI portal
Publication:3710617
zbMath0585.13010MaRDI QIDQ3710617
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
The irreducibility of ladder determinantal varieties, New constructive methods in classical ideal theory, A semi-algebraic version of Zarankiewicz's problem, Regularity Bounds by Projection, Regularity of prime ideals, Unnamed Item, Bounds for the Castelnuovo-Mumford regularity, History and basic features of the critical-pair/completion procedure, Computing generators of the ideal of a smooth affine algebraic variety, Castelnuovo-Mumford regularity of initial ideals, A Pommaret bases approach to the degree of a polynomial ideal, On the complexity of the integral closure, Computing dimension and independent sets for polynomial ideals, The regularity conjecture for prime ideals in polynomial rings, On the complexity exponent of polynomial system solving, Standard bases and geometric invariant theory. I: Initial ideals and state polytopes, Computation of real radicals of polynomial ideals. II, Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties, Refined F5 Algorithms for Ideals of Minors of Square Matrices, A decision method for the integrability of differential-algebraic Pfaffian systems, Continuity properties for flat families of polynomials. I: Continuous parametrizations, Finiteness of Hilbert functions and bounds for Castelnuovo-Mumford regularity of initial ideals, Combinatorial dimension theory of algebraic varieties, Sur le problème d’équivalence de Cartan, On the robust hardness of Gröbner basis computation, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, On the Gröbner bases of some symmetric systems and their application to coding theory., Efficient computation of Castelnuovo-Mumford regularity, The degree-complexity of the defining ideal of a smooth integral curve, Bounds for the Castelnuovo-Mumford regularity of modules, Comprehensive Gröbner bases, On the Jacobian conjecture: A new approach via Gröbner bases, Solving non-linear Boolean equation systems by variable elimination, Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients, Dimension and depth dependent upper bounds in polynomial ideal theory, Zacharias representation of effective associative rings, Degree upper bounds for involutive bases, Incomplete Gröbner basis as a preconditioner for polynomial systems, Complexity of a standard basis of a $D$-module, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, Degree bounds for Gröbner bases of modules, Computation of Macaulay constants and degree bounds for Gröbner bases, Trajectories of polynomial vector fields and ascending chains of polynomial ideals, Reduction numbers of ideals, Counterexamples to the Eisenbud–Goto regularity conjecture, On the complexity of the \(F_5\) Gröbner basis algorithm, Geometric theory of invariants of groups generated by reflections, A new lower bound construction for commutative Thue systems with applications, A sharp bound for the Castelnuovo-Mumford regularity of subspace arrangements., Linearly presented modules and bounds on the Castelnuovo-Mumford regularity of ideals
