Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > NEWTON:
Reports tagged with Newton:
TR10-118 | 27th July 2010
Maurice Jansen

Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods

Revisions: 2

For two polynomials $f \in \mathbb{F}[x_1, x_2, \ldots, x_n, y]$ and $p \in \mathbb{F}[x_1, x_2, \ldots, x_n]$, we say that $p$ is a root of $f$, if $f(x_1, x_2, \ldots, x_n, p) \equiv 0$. We study the relation between the arithmetic circuit sizes of $f$ and $p$ for general circuits ... more >>>

ISSN 1433-8092 | Imprint