Sciweavers

38 search results - page 1 / 8
» Read-Once Polynomial Identity Testing
Sort
View
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
13 years 11 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
ECCC
2010
89views more  ECCC 2010»
13 years 5 months ago
Read-Once Polynomial Identity Testing
An arithmetic read-once formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+,
Amir Shpilka, Ilya Volkovich
ECCC
2010
83views more  ECCC 2010»
13 years 3 months ago
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
Maurice Jansen, Youming Qiao, Jayalal M. N. Sarma
ECCC
2010
79views more  ECCC 2010»
13 years 2 months ago
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
Matthew Anderson, Dieter van Melkebeek, Ilya Volko...
COCO
2004
Springer
86views Algorithms» more  COCO 2004»
13 years 10 months ago
Deterministic Polynomial Identity Testing in Non-Commutative Models
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
Ran Raz, Amir Shpilka