The following pages link to (Q3208084):
Displaying 50 items.
- The F5 algorithm in Buchberger's style (Q301017) (← 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)
- Parametric FGLM algorithm (Q512366) (← 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)
- Computing inhomogeneous Gröbner bases (Q633077) (← links)
- Applying IsRewritten criterion on Buchberger algorithm (Q638523) (← links)
- Extended parallelism in the Gröbner basis algorithm (Q685087) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- Multi-valued logic and Gröbner bases with applications to modal logic (Q804567) (← links)
- On the construction of Gröbner bases using syzygies (Q909718) (← links)
- An algorithm for the construction of matrix representations for finitely presented non-commutative algebras (Q914800) (← links)
- Certifying properties of an efficient functional program for computing Gröbner bases (Q1012152) (← links)
- Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators. (Q1012560) (← links)
- Computing representations for radicals of finitely generated differential ideals (Q1015366) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- New constructive methods in classical ideal theory (Q1090369) (← links)
- Using Gröbner bases to reason about geometry problems (Q1094150) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- Gröbner bases and primary decomposition of polynomial ideals (Q1117277) (← links)
- A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
- On an installation of Buchberger's algorithm (Q1121950) (← links)
- A refutational approach to geometry theorem proving (Q1124373) (← links)
- On superG-bases (Q1173723) (← links)
- Computational algebraic geometry of projective configurations (Q1176393) (← links)
- A computational model for algebraic power series (Q1184020) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- On the walk (Q1389631) (← links)
- Modular algorithms for computing Gröbner bases. (Q1401905) (← links)
- Involutive bases of polynomial ideals (Q1404736) (← links)
- Minimal involutive bases (Q1404737) (← links)
- Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry. (Q1426143) (← links)
- Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. II: Conic geometry. (Q1426144) (← links)
- Computing comprehensive Gröbner systems: a comparison of two methods (Q1650394) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
- Ideal basis and primary decompositions: case of two variables (Q1821556) (← links)
- Decomposing algebraic sets using Gröbner bases (Q1823621) (← links)
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence (Q1823681) (← links)
- Taylor and Lyubeznik resolutions via Gröbner bases. (Q1867002) (← links)
- A combined method for enclosing all solutions of nonlinear systems of polynomial equations (Q1899456) (← links)
