Solver for Mandelbrot polynomials based on MPSolve

 A polynomial rootfinder that can determine arbitrary precision approximations
 with guaranteed inclusion radii.
 It supports exploiting of polynomial structures such as sparsisty and allows
 for polynomial implicitly defined or in some non standard basis.
 This binary, provided as an example of custom polynomial
 implementation in the MPSolve package, uses the particular structure
 of this family of polynomials to develop an efficient solver that
 exhibit experimental O(n^2) complexity.
 .
 This package contains the specialization of mpsolve to Mandelbrot polynomials.