FGb/Gb libraryGb is a program (191 420 lines of C++) for computing Grobner bases, implement ”standard” algoritms. FGb (206 052 lines of C) ia an efficient program written in C for solving polynomial systems. The purpose of the FGb library is twofold. First of all, the main goal is to provide efficient implementations of state-of-the-art algorithms for computing Gröbner bases: actually, from a research point of view, it is mandatory to have such an implementation to demonstrate the practical efficiency of new algorithms. Secondly, in conjunction with other software, the FGb library has been used in various applications (Robotic, Signal Theory, Biology, Computational Geometry, . . . ) and more recently to a wide range of problems in Cryptology (for instance, FGb was explicitly used in [2, 8, 9, 4, 5] to break several cryptosystems)

References in zbMATH (referenced in 247 articles , 1 standard article )

Showing results 1 to 20 of 247.
Sorted by year (citations)

1 2 3 ... 11 12 13 next

  1. Le, Huu Phuoc; Safey El Din, Mohab: Solving parametric systems of polynomial equations over the reals through Hermite matrices (2022)
  2. Berthomieu, Christian Eder, Mohab Safey El Din: msolve: A Library for Solving Polynomial Systems (2021) arXiv
  3. Fernique, Thomas; Hashemi, Amir; Sizova, Olga: Compact packings of the plane with three sizes of discs (2021)
  4. Henrion, Didier; Naldi, Simone; Safey El Din, Mohab: Exact algorithms for semidefinite programs with degenerate feasible set (2021)
  5. Mourrain, Bernard; Telen, Simon; Van Barel, Marc: Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (2021)
  6. Raviv, Netanel; Langton, Ben; Tamo, Itzhak: Multivariate public key cryptosystem from Sidon spaces (2021)
  7. Capco, Jose; Din, Mohab Safey El; Schicho, Josef: Robots, computer algebra and eight connected components (2020)
  8. Grasegger, Georg; Koutschan, Christoph; Tsigaridas, Elias: Lower bounds on the number of realizations of rigid graphs (2020)
  9. Henrion, Didier; Naldi, Simone; Safey El Din, Mohab: Real root finding for low rank linear matrices (2020)
  10. Horáček, Jan; Kreuzer, Martin: On conversions from CNF to ANF (2020)
  11. Poslavsky, Stanislav: Rings: an efficient JVM library for commutative algebra (invited talk) (2019)
  12. Bender, Matías R.; Faugère, Jean-Charles; Mantzaflaris, Angelos; Tsigaridas, Elias: Bilinear systems with two supports. Koszul resultant matrices, eigenvalues, and eigenvectors (2018)
  13. Capco, Jose; Gallet, Matteo; Grasegger, Georg; Koutschan, Christoph; Lubbes, Niels; Schicho, Josef: The number of realizations of a Laman graph (2018)
  14. Faugère, Jean-Charles; Wallet, Alexandre: The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (2018)
  15. Greenwood, Torin: Asymptotics of bivariate analytic functions with algebraic singularities (2018)
  16. Güler, Erhan; Kişi, Ömer; Konaxis, Christos: Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space (2018)
  17. Horáček, Jan; Kreuzer, Martin: 3BA: a border bases solver with a SAT extension (2018)
  18. Jiang, Yunfeng; Zhang, Yang: Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE (2018)
  19. Naldi, Simone: Solving rank-constrained semidefinite programs in exact arithmetic (2018)
  20. Dong, Rina; Mou, Chenqi: Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets (2017)

1 2 3 ... 11 12 13 next

Further publications can be found at: http://www-polsys.lip6.fr/~jcf/Publications/index.html