FGb
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Thirty years of polynomial system solving, and now?
- Certifying properties of an efficient functional program for computing Gröbner bases
- Algebraic systems of matrices and Gröbner basis theory
- The Voronoi diagram of three lines
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A new efficient algorithm for computing Gröbner bases (F₄)
- Gb
- Kronecker
- M4RI
- Magma
- Maple
- Mathemagix
- MuPAD
- PolyBoRi
- Projective Noether
- RAGlib
- fgb_sage
- Sidon Cryptosystem
- SARAG
- SingSurf
- SINGULAR
- slimgb
- SumCracker
- SYNAPS
- POLSYS_PLP
- Scream
- Fast algorithms for zero-dimensional polynomial systems using duality
- VoDKA
- FLASH
- EARTH--MANNA
- BERGMAN
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- 3BA: a border bases solver with a SAT extension
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
- Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision
- Solving polynomial equations. Foundations, algorithms, and applications
- On the Bézout construction of the resultant
- ApCoCoA
- On parallel block algorithms for exact triangularizations
- BIBasis
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Xcas
- Groebner
- Injectivity of real rational mappings: the case of a mixture of two Gaussian laws
- On the complexity of solving quadratic Boolean systems
- CandS
- Multivariate public key cryptosystems from Diophantine equations
- Integrability conditions for Lotka-Volterra planar complex quartic systems having homogeneous nonlinearities
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
- On computation of Boolean involutive bases
- Slimgb: Gröbner bases with slim polynomials
- Recognizing graph theoretic properties with polynomial ideals
- ISOLATE
- Compact packings of the plane with three sizes of discs
- DIFFALG
- Multivariate public key cryptosystem from Sidon spaces
- Computing critical points for invariant algebraic systems
- GenRGenS
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Real root finding for low rank linear matrices
- Rings: an efficient JVM library for commutative algebra (invited talk)
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Improved agreeing-gluing algorithm
- primdec
- On conversions from CNF to ANF
- Implicit equations of the Henneberg-type minimal surface in the four-dimensional Euclidean space
- antom
- Degeneracy loci and polynomial equation solving
- On the complexity of the \(F_5\) Gröbner basis algorithm
- na10
- AIDA
- Linear algebraic approach to Gröbner-Shirshov basis theory
- Stable normal forms for polynomial system solving
- A Groebner bases-based approach to backward reasoning in rule based expert systems
- Asymptotics of bivariate analytic functions with algebraic singularities
- Solving rank-constrained semidefinite programs in exact arithmetic
- PerMuVAR
- Testing sign conditions on a multivariate polynomial and applications
- The membrane inclusions curvature equations
- Newton's method with deflation for isolated singularities of polynomial systems
- f5_library.lib
- Phcmaple
- HiTag2
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
- Structural cryptanalysis of McEliece schemes with compact keys
- Sufficient set of integrability conditions of an orthonomic system
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- On the computation of rational solutions of underdetermined systems over a finite field
- GBLA
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Strong Gröbner bases for polynomials over a principal ideal ring.
- Geomsolvex
- The implementation and complexity analysis of the branch Gröbner bases algorithm over Boolean polynomial rings
- Overview of the Mathemagix type system
- Border basis for polynomial system solving and optimization
- Exact algorithms for linear matrix inequalities
This page was built for software: FGb
