Database of Polynomial Systems
From MaRDI portal
Cited in
(20)- An efficient algorithm for range computation of polynomials using the Bernstein form
- POLSYS_PLP
- PHoMpara
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- PoSSo
- BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
- BIBasis
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
- POLSYS_GLP
- A dynamic F4 algorithm to compute Gröbner bases
- Formalization of Bernstein polynomials and applications to global optimization
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Manip
- BertiniLab
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Parallelization of triangular decompositions: techniques and implementation
- Audi
- gb
- singular-benchmarks
- Dynamic.sage
This page was built for software: Database of Polynomial Systems
