The following pages link to FGb (Q13048):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- The F5 algorithm in Buchberger's style (Q301017) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- The \({1:-q}\) resonant center problem for certain cubic Lotka-Volterra systems (Q387701) (← links)
- The center problem for a \({1:-4}\) resonant quadratic system (Q401099) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Variant quantifier elimination (Q420753) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Computation of non-commutative Gröbner bases in Grassmann and Clifford algebras (Q605268) (← links)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases (Q607065) (← links)
- On the determination of cusp points of 3-RPR parallel manipulators (Q612672) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Isochronicity conditions for some planar polynomial systems (Q627701) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Artificial discontinuities of single-parametric Gröbner bases (Q629351) (← links)
- Isochronicity conditions for some planar polynomial systems. II. (Q630626) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation (Q632158) (← links)
- Computing modular correspondences for abelian varieties (Q661914) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- Irreducible decomposition of curves (Q697491) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- On enumeration of polynomial equivalence classes and their application to MPKC (Q765801) (← links)
- Involutive method for computing Gröbner bases over \(\mathbb F_2\) (Q840027) (← links)
- On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Algebraic approaches to stability analysis of biological systems (Q926326) (← links)
- On selection of nonmultiplicative prolongations in computation of Janet bases (Q926621) (← links)
- Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM (Q982780) (← links)
- Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides (Q991137) (← links)
- A generalization of Castelnuovo-Mumford regularity for representations of noncommutative algebras. (Q994276) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Certifying properties of an efficient functional program for computing Gröbner bases (Q1012152) (← links)
- Algebraic systems of matrices and Gröbner basis theory (Q1014481) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- 3BA: a border bases solver with a SAT extension (Q1662237) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets (Q1701473) (← links)
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE (Q1750927) (← links)
