FGb: A Library for Computing Gröbner Bases
From MaRDI portal
Recommendations
- A new framework for computing Gröbner bases
- On FGLM algorithms with tropical Gröbner bases
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Slimgb: Gröbner bases with slim polynomials
- Computation of Gröbner bases
- Practical Gröbner basis computation
- A dynamic F4 algorithm to compute Gröbner bases
- An efficient method for computing comprehensive Gröbner bases
- scientific article; zbMATH DE number 4112737
Cited in
(41)- The Voronoi diagram of three lines
- FGb
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
- Integrability conditions for Lotka-Volterra planar complex quartic systems having homogeneous nonlinearities
- Compact packings of the plane with three sizes of discs
- Multivariate public key cryptosystem from Sidon spaces
- Computing critical points for invariant algebraic systems
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Real root finding for low rank linear matrices
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- On conversions from CNF to ANF
- Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space
- Degeneracy loci and polynomial equation solving
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Asymptotics of bivariate analytic functions with algebraic singularities
- Solving rank-constrained semidefinite programs in exact arithmetic
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Structural cryptanalysis of McEliece schemes with compact keys
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Border basis for polynomial system solving and optimization
- Exact algorithms for linear matrix inequalities
- GBLA: Gröbner basis linear algebra package
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- Representing and solving finite-domain constraint problems using systems of polynomials
- The center problem for a \({1:-4}\) resonant quadratic system
- The number of realizations of a Laman graph
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Asymptotics of bivariate analytic functions with algebraic singularities
- Lower bounds on the number of realizations of rigid graphs
- On FGLM algorithms with tropical Gröbner bases
- Absolute root separation
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- Computing modular correspondences for abelian varieties
- msolve. A library for solving polynomial systems
- Computing the dimension of real algebraic sets
- Faster one block quantifier elimination for regular polynomial systems of equations
- C. C. Chen's minimal surface: from parametric form to algebraic equation
- Solving parameter-dependent semi-algebraic systems
- A geometric approach to cylindrical algebraic decomposition
- Real root finding for determinants of linear matrices
This page was built for publication: FGb: A Library for Computing Gröbner Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747865)
