Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations
DOI10.1145/321752.321759zbMATH Open0256.65028OpenAlexW1971411079MaRDI QIDQ5671579FDOQ5671579
Authors: Armin Friedli 
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321752.321759
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Numerical computation of solutions to single equations (65H05) Special properties of functions of several variables, Hölder conditions, etc. (26B35)
Cited In (1)
This page was built for publication: Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671579)
