PIT for depth-4 circuits and Sylvester-Gallai conjecture for polynomials

02/19/2019
by   Alexey Milovanov, et al.
0

This text is a development of a preprint of Ankit Gupta. We present an approach for devising a deterministic polynomial time blackbox identity testing (PIT) algorithm for depth-4 circuits with bounded top fanin. This approach is similar to Kayal-Shubhangi approach for depth-3 circuits. Kayal and Shubhangi based their algorithm on Sylvester-Gallai-type theorem about linear polynomials. We show how it is possible to generalize this approach to depth-4 circuits. However we failed to implement this plan completely. We succeeded to construct a polynomial time deterministic algorithm for depth-4 circuits with bounded top fanin and its correctness requires a hypothesis. Also we present a polynomial-time (unconditional) algorithm for some subclass of depth-4 circuits with bounded top fanin.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2019

CC-circuits and the expressive power of nilpotent algebras

We show that CC-circuits of bounded depth have the same expressive power...
research
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...
research
04/22/2023

Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits

Polynomial Identity Testing (PIT) is a fundamental computational problem...
research
07/26/2020

Cyclotomic Identity Testing and Applications

We consider the cyclotomic identity testing (CIT) problem: given a polyn...
research
02/19/2021

Parallel algorithms for power circuits and the word problem of the Baumslag group

Power circuits have been introduced in 2012 by Myasnikov, Ushakov and Wo...
research
09/07/2020

PolyAdd: Polynomial Formal Verification of Adder Circuits

Only by formal verification approaches functional correctness can be ens...

Please sign up or login with your details

Forgot password? Click here to reset