FGb: A Library for Computing Gröbner Bases
From MaRDI portal
Publication:5747865
DOI10.1007/978-3-642-15582-6_17zbMath1294.68156OpenAlexW2117819179MaRDI QIDQ5747865
Publication date: 14 September 2010
Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15582-6_17
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (34)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ The Number of Realizations of a Laman Graph ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ Representing and solving finite-domain constraint problems using systems of polynomials ⋮ Asymptotics of bivariate analytic functions with algebraic singularities ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Real root finding for low rank linear matrices ⋮ Solving rank-constrained semidefinite programs in exact arithmetic ⋮ Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics ⋮ The center problem for a \({1:-4}\) resonant quadratic system ⋮ Real root finding for determinants of linear matrices ⋮ Lower Bounds on the Number of Realizations of Rigid Graphs ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Integrability conditions for Lotka-Volterra planar complex quartic systems having homogeneous nonlinearities ⋮ Computing modular correspondences for abelian varieties ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Exact algorithms for semidefinite programs with degenerate feasible set ⋮ Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE ⋮ On the complexity of computing Gröbner bases for weighted homogeneous systems ⋮ Unnamed Item ⋮ Compact packings of the plane with three sizes of discs ⋮ Border Basis for Polynomial System Solving and Optimization ⋮ FGb ⋮ On conversions from CNF to ANF ⋮ Multivariate public key cryptosystem from Sidon spaces ⋮ The Voronoi diagram of three lines ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space ⋮ Degeneracy loci and polynomial equation solving ⋮ Computing critical points for invariant algebraic systems ⋮ On the complexity of the \(F_5\) Gröbner basis algorithm ⋮ Absolute Root Separation ⋮ Solving parametric systems of polynomial equations over the reals through Hermite matrices
Uses Software
This page was built for publication: FGb: A Library for Computing Gröbner Bases
