DeepAI AI Chat
Log In Sign Up

Closure of VP under taking factors: a short and simple proof

03/06/2019
by   Chi-Ning Chou, et al.
Harvard University
0

In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an n variate degree d polynomial f can be computed by an arithmetic circuit of size s, then each of its factors can be computed by an arithmetic circuit of size at most poly(s, n, d). However, unlike Kaltofen's argument, our proof does not directly give an efficient algorithm for computing the circuits for the factors of f.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/10/2018

On top fan-in vs formal degree for depth-3 arithmetic circuits

We show that over the field of complex numbers, every homogeneous polyno...
09/06/2013

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

We provide an elementary proof of a simple, efficient algorithm for comp...
03/15/2018

Some Closure Results for Polynomial Factorization and Applications

In a sequence of seminal results in the 80's, Kaltofen showed that the c...
05/17/2018

A Note on Polynomial Identity Testing for Depth-3 Circuits

Let C be a depth-3 arithmetic circuit of size at most s, computing a pol...
02/15/2020

Symmetric Arithmetic Circuits

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits wit...
10/09/2017

Discovering the roots: Uniform closure results for algebraic classes under factoring

Newton iteration (NI) is an almost 350 years old recursive formula that ...
06/13/2012

Learning Arithmetic Circuits

Graphical models are usually learned without regard to the cost of doing...