
PIT for depth4 circuits and SylvesterGallai conjecture for polynomials
This text is a development of a preprint of Ankit Gupta. We present an...
read it

Efficient BlackBox Identity Testing over Free Group Algebra
Hrubeš and Wigderson [HW14] initiated the study of noncommutative arithm...
read it

SylvesterGallai type theorems for quadratic polynomials
We prove SylvesterGallai type theorems for quadratic polynomials. Speci...
read it

A generalized SylvesterGallai type theorem for quadratic polynomials
In this work we prove a version of the SylvesterGallai theorem for quad...
read it

Reconstruction Algorithms for LowRank Tensors and Depth3 Multilinear Circuits
We give new and efficient blackbox reconstruction algorithms for some c...
read it

Recognizing Linked Domain in Polynomial Time
The celebrated GibbardSatterthwaite Theorem states that any surjective ...
read it

Subspace arrangements, graph rigidity and derandomization through submodular optimization
This paper presents a deterministic, strongly polynomial time algorithm ...
read it
Polynomial time deterministic identity testingalgorithm for Σ^[3]ΠΣΠ^[2] circuits via EdelsteinKelly type theorem for quadratic polynomials
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As immediate corollary we obtain the first deterministic polynomial time blackbox algorithm for testing zeroness of Σ^[3]ΠΣΠ^[2] circuits.
READ FULL TEXT
Comments
There are no comments yet.