Pages that link to "Item:Q5747865"

The following pages link to FGb: A Library for Computing Gröbner Bases (Q5747865):

Displaying 38 items.

• FGb (Q13048) (← links)
• Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← 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 center problem for a \({1:-4}\) resonant quadratic system (Q401099) (← links)
• Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
• Computing modular correspondences for abelian varieties (Q661914) (← links)
• Real root finding for determinants of linear matrices (Q898255) (← links)
• The Voronoi diagram of three lines (Q1028584) (← links)
• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
• Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE (Q1750927) (← links)
• Integrability conditions for Lotka-Volterra planar complex quartic systems having homogeneous nonlinearities (Q1947016) (← links)
• Compact packings of the plane with three sizes of discs (Q2046442) (← links)
• Multivariate public key cryptosystem from Sidon spaces (Q2061921) (← links)
• Computing critical points for invariant algebraic systems (Q2100065) (← links)
• Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
• Real root finding for low rank linear matrices (Q2175227) (← links)
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (Q2200298) (← links)
• Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
• On conversions from CNF to ANF (Q2307626) (← links)
• Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space (Q2337240) (← links)
• Degeneracy loci and polynomial equation solving (Q2340506) (← links)
• On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
• Asymptotics of bivariate analytic functions with algebraic singularities (Q2403715) (← links)
• Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
• A probabilistic algorithm for computing data-discriminants of likelihood equations (Q2628325) (← links)
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
• Border Basis for Polynomial System Solving and Optimization (Q2819219) (← links)
• Exact algorithms for linear matrix inequalities (Q2834563) (← links)
• The Number of Realizations of a Laman Graph (Q4564015) (← links)
• (Q5110989) (← links)
• Lower Bounds on the Number of Realizations of Rigid Graphs (Q5114449) (← links)
• On FGLM algorithms with tropical Gröbner bases (Q5145981) (← links)
• Absolute Root Separation (Q5866500) (← links)
• On the complexity of computing Gröbner bases for weighted homogeneous systems (Q5963397) (← links)
• msolve. A library for solving polynomial systems (Q6666519) (← links)
• Computing the dimension of real algebraic sets (Q6666545) (← links)
• Faster one block quantifier elimination for regular polynomial systems of equations (Q6666546) (← links)