The following pages link to (Q3325833):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- MaxMinMax problem and sparse equations over finite fields (Q285259) (← links)
- First order perturbation and local stability of parametrized systems (Q294387) (← links)
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra (Q328226) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- A new proof for the correctness of the F5 algorithm (Q365812) (← links)
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases (Q382761) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Parametric FGLM algorithm (Q512366) (← links)
- Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals (Q512371) (← links)
- An improvement over the GVW algorithm for inhomogeneous polynomial systems (Q530403) (← links)
- On the Jacobian conjecture: A new approach via Gröbner bases (Q584328) (← links)
- Extended \(F_5\) criteria (Q607057) (← links)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases (Q607065) (← links)
- CAD and topology of semi-algebraic sets (Q626978) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Applying IsRewritten criterion on Buchberger algorithm (Q638523) (← links)
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography (Q733509) (← links)
- Stronger bounds on the cost of computing Gröbner bases for HFE systems (Q820971) (← links)
- Gröbner bases and invariant theory (Q909717) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- On the computation of generalized standard bases (Q914763) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form (Q1006657) (← links)
- Degree bounds for Gröbner bases in algebras of solvable type (Q1017676) (← links)
- A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type (Q1038703) (← links)
- New constructive methods in classical ideal theory (Q1090369) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Solving systems of algebraic equations by a general elimination method (Q1104981) (← links)
- Stability of Gröbner bases (Q1115488) (← links)
- The Gröbner fan of an ideal (Q1117983) (← links)
- Standard bases and geometric invariant theory. I: Initial ideals and state polytopes (Q1121951) (← links)
- Recent improvements in the complexity of the effective Nullstellensatz (Q1177257) (← links)
- Equations for the projective closure and effective Nullstellensatz (Q1180147) (← links)
- La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra (Q1180161) (← links)
- A note on upper bounds for ideal-theoretic problems (Q1185454) (← links)
- Nonlinear reduction for solving deficient polynomial systems by continuation methods (Q1195900) (← links)
- On the derivation and reduction of \(C^ 1\) trigonometric basis functions using Maple\(^{TM}\) (Q1198236) (← links)
- Solutions of systems of algebraic equations and linear maps on residue class rings (Q1201351) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- The virtues of laziness: Complexity of the tangent cone algorithm (Q1311617) (← links)
- A solution to Kronecker's problem (Q1335137) (← links)
- The tangent cone algorithm and homogenization (Q1346190) (← links)
- An algorithm of computing \(b\)-functions (Q1355292) (← links)
