Back to Results
First PageMeta Content
Polynomials / Degree of a polynomial / Root-finding algorithm / Arithmetic circuit complexity / Algebraic geometry / Mathematics / Abstract algebra / Algebra


Improved Complexity Bounds for Computing with Planar Algebraic Curves Alexander Kobel1–3 Michael Sagraloff1
Add to Reading List

Document Date: 2014-01-22 20:37:59


Open Document

File Size: 707,79 KB

Share Result on Facebook

Currency

pence / /

/

IndustryTerm

dimensional systems / zero-dimensional systems / deterministic algorithms / polynomial systems / deterministic algorithm / bivariate systems / computing / Numerical algorithms / candidate solutions / possible solution / approximate solutions / distinct solutions / distinct complex solutions / real valued solutions / bivariate polynomial systems / /

Movie

D. 3 / /

Organization

School for Computer Science / Max-Planck-Institut f¨ / U.S. Securities and Exchange Commission / /

Person

Sylvain Lazard / Max Planck / /

Technology

so-obtained algorithm / deterministic algorithm / corresponding algorithm / /

SocialTag