The following pages link to (Q3710617):
Displayed 50 items.
- On the Jacobian conjecture: A new approach via Gröbner bases (Q584328) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Geometric theory of invariants of groups generated by reflections (Q807750) (← links)
- A new lower bound construction for commutative Thue systems with applications (Q808265) (← links)
- Bounds for the Castelnuovo-Mumford regularity (Q847950) (← links)
- A decision method for the integrability of differential-algebraic Pfaffian systems (Q895975) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- The degree-complexity of the defining ideal of a smooth integral curve (Q932797) (← links)
- Incomplete Gröbner basis as a preconditioner for polynomial systems (Q1008653) (← links)
- The irreducibility of ladder determinantal varieties (Q1083500) (← links)
- New constructive methods in classical ideal theory (Q1090369) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Computing dimension and independent sets for polynomial ideals (Q1116332) (← links)
- Standard bases and geometric invariant theory. I: Initial ideals and state polytopes (Q1121951) (← links)
- Comprehensive Gröbner bases (Q1199704) (← links)
- Trajectories of polynomial vector fields and ascending chains of polynomial ideals (Q1288648) (← links)
- Reduction numbers of ideals (Q1305054) (← links)
- Computation of real radicals of polynomial ideals. II (Q1380019) (← links)
- Continuity properties for flat families of polynomials. I: Continuous parametrizations (Q1408354) (← links)
- On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- A sharp bound for the Castelnuovo-Mumford regularity of subspace arrangements. (Q1865280) (← links)
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Degree upper bounds for involutive bases (Q2035622) (← links)
- Degree bounds for Gröbner bases of modules (Q2066953) (← links)
- Computation of Macaulay constants and degree bounds for Gröbner bases (Q2066954) (← links)
- Dimension and depth dependent upper bounds in polynomial ideal theory (Q2284949) (← links)
- Zacharias representation of effective associative rings (Q2284968) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Bounds for the Castelnuovo-Mumford regularity of modules (Q2463375) (← links)
- Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients (Q2509948) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- Regularity of prime ideals (Q2633072) (← links)
- Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
- Castelnuovo-Mumford regularity of initial ideals (Q2643566) (← links)
- The regularity conjecture for prime ideals in polynomial rings (Q2656616) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Complexity of a standard basis of a $D$-module (Q3079271) (← links)
- Counterexamples to the Eisenbud–Goto regularity conjecture (Q3133832) (← links)
- Finiteness of Hilbert functions and bounds for Castelnuovo-Mumford regularity of initial ideals (Q3522278) (← links)
- Sur le problème d’équivalence de Cartan (Q4609684) (← links)
- On the complexity of the integral closure (Q4825658) (← links)
- Linearly presented modules and bounds on the Castelnuovo-Mumford regularity of ideals (Q5027183) (← links)
- Regularity Bounds by Projection (Q5051894) (← links)
- (Q5205507) (← links)
- Efficient computation of Castelnuovo-Mumford regularity (Q5389451) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)