Sciweavers

7 search results - page 2 / 2
» Deterministic polynomial identity tests for multilinear boun...
Sort
View
ECCC
2010
83views more  ECCC 2010»
14 years 8 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
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 4 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret