The following pages link to Database of Polynomial Systems (Q54382):
Displaying 9 items.
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (Q1758701) (← links)
- Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (Q1872931) (← links)
- A dynamic F4 algorithm to compute Gröbner bases (Q2025446) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems (Q2642945) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
