Access the full text.
Sign up today, get DeepDyve free for 14 days.
Michael Forbes, Amir Shpilka (2012)
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Matthew Anderson, D. Melkebeek, Ilya Volkovich (2011)
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae2011 IEEE 26th Annual Conference on Computational Complexity
Sanjeev Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy (1992)
Proof verification and hardness of approximation problemsProceedings., 33rd Annual Symposium on Foundations of Computer Science
N. Bshouty, T. Hancock, L. Hellerstein (1995)
Learning Boolean Read-Once Formulas over Generalized BasesJ. Comput. Syst. Sci., 50
Michael Forbes, Amir Shpilka, Iddo Tzameret, A. Wigderson (2016)
Proof Complexity Lower Bounds from Algebraic Circuit ComplexityElectron. Colloquium Comput. Complex., TR16
P. Mukhopadhyay (2016)
Depth-4 Identity Testing and Noether's Normalization LemmaElectron. Colloquium Comput. Complex., TR15
A. Shpilka, I. Volkovich (2008)
Read-once polynomial identity testingProceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC’08)
Mrinal Kumar, Shubhangi Saraf (2015)
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing
M. Kumar, S. Saraf (2016)
Arithmetic circuits with locally low algebraic rankProceedings of the 31st Conference on Computational Complexity (CCC’16), 34
N. Saxena, C. Seshadhri (2010)
From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for deph-3 circuitsProceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS’10)
(1999)
N. Alon. Combinatorial nullstellensatz. Combinatorics, Probability and Computing
N. Kayal, Nitin Saxena (2006)
Polynomial Identity Testing for Depth 3 Circuitscomputational complexity, 16
Ankit Gupta (2014)
Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for VarietiesElectron. Colloquium Comput. Complex., TR14
Mrinal Kumar, Shubhangi Saraf (2016)
Arithmetic Circuits with Locally Low Algebraic Rank
Matthew Anderson, Michael Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Volk (2015)
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching ProgramsACM Transactions on Computation Theory (TOCT), 10
M. Anderson, M. A. Forbes, R. Saptharishi, A. Shpilka, B. L. Volk (2016)
Identity testing and lower bounds for read-k oblivious algebraic branching programsProceedings of the 31st Conference on Computational Complexity (CCC’16), 30
M. MacCallum (1994)
Proceedings of the international symposium on Symbolic and algebraic computation
D. Bshouty, N. Bshouty (1998)
On Interpolating Arithmetic Read-Once Formulas with ExponentiationJ. Comput. Syst. Sci., 56
Amir Shpilka, Ilya Volkovich (2009)
Improved Polynomial Identity Testing for Read-Once Formulas
(2009)
In APPROX-RANDOM
Michael Forbes, Ramprasad Saptharishi, Amir Shpilka (2013)
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any OrderArXiv, abs/1309.5668
Manindra Agrawal, Chandan Saha, Nitin Saxena (2012)
Quasi-polynomial hitting-set for set-depth-Δ formulas
M. Beecken, J. Mittmann, N. Saxena (2011)
Algebraic independence and blackbox identity testingProceedings of the 38th International Colloquium on Automata
Adam Klivans, D. Spielman (2001)
Randomness efficient identity testing of multivariate polynomials
Malte Beecken, Johannes Mittmann, Nitin Saxena (2011)
Algebraic independence and blackbox identity testingElectron. Colloquium Comput. Complex., TR11
N. Bshouty, T. Hancock, L. Hellerstein (1992)
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
J. Heintz, C. Schnorr (1980)
Testing polynomials which are easy to compute (Extended Abstract)
Matthew Anderson, D. Melkebeek, Ilya Volkovich (2015)
Deterministic polynomial identity tests for multilinear bounded-read formulaecomputational complexity, 24
(2016)
Identity testing for constant-width, and commutative , read-once oblivious abps
Amir Shpilka, A. Yehudayoff (2010)
Arithmetic Circuits: A survey of recent results and open questionsFound. Trends Theor. Comput. Sci., 5
Manindra Agrawal, N. Kayal, Nitin Saxena (2004)
PRIMES is in PAnnals of Mathematics, 160
Michael Forbes, Amir Shpilka (2013)
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity TestingElectron. Colloquium Comput. Complex., TR13
Zeev Dvir, Amir Shpilka (2005)
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Nitin Saxena, C. Seshadhri (2008)
An Almost Optimal Rank Bound for Depth-3 Identities2009 24th Annual IEEE Conference on Computational Complexity
Stephen Fenner, R. Gurjar, T. Thierauf (2016)
Bipartite perfect matching is in quasi-NCProceedings of the forty-eighth annual ACM symposium on Theory of Computing
Z. Dvir, A. Shpilka (2006)
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuitsSIAM Journal on Computing, 36
M. Karchmer, N. Linial, I. Newman, M. Saks, A. Wigderson (1993)
Combinatorial characterization of read-once formulaeDiscret. Math., 114
Zohar Karnin, Amir Shpilka (2008)
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-inCombinatorica, 31
V. Arvind, P. Mukhopadhyay (2007)
The Monomial Ideal Membership Problem and Polynomial Identity Testing
A. Shamir (1992)
IP = PSPACE
Manindra Agrawal (2005)
Proving Lower Bounds Via Pseudo-random Generators
K. Mulmuley, U. Vazirani, V. Vazirani (1987)
Matching is as easy as matrix inversionCombinatorica, 7
Zohar Karnin, P. Mukhopadhyay, Amir Shpilka, Ilya Volkovich (2010)
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Amir Shpilka, Ilya Volkovich (2014)
On Reconstruction and Testing of Read-Once FormulasTheory Comput., 10
M. Ben-Or, Prasoon Tiwari (1988)
A deterministic algorithm for sparse multivariate polynomial interpolation
L. Lovász (1979)
On determinants, matchings, and random algorithms
N. H. Bshouty, T. R. Hancock, L. Hellerstein (1995)
Learning arithmetic read-once formulasSIAM Journal on Computing, 24
D. Angluin, L. Hellerstein, Marek Karpinski (1993)
Learning read-once formulas with queriesJ. ACM, 40
Oleg Golberg (2007)
Combinatorial Nullstellensatz
Nitin Saxena, And Seshadhri (2010)
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits2010 IEEE 51st Annual Symposium on Foundations of Computer Science
T. Hancock, L. Hellerstein (1991)
Learning read-once formulas over fields and extended bases
J. Schwartz (1980)
Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM (JACM), 27
Manindra Agrawal, Chandan Saha, Nitin Saxena (2012)
Quasi-polynomial Hitting-set for Set-depth-Delta FormulasElectron. Colloquium Comput. Complex., TR12
Sanjeev Arora, S. Safra (1998)
Probabilistic checking of proofs: a new characterization of NPJ. ACM, 45
(2003)
In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
N. Bshouty, R. Cleve (1998)
Interpolating Arithmetic Read-Once Formulas in ParallelSIAM J. Comput., 27
(2008)
35th International Colloquium
V. Arvind, P. Mukhopadhyay (2010)
The ideal membership problem and polynomial identity testingElectron. Colloquium Comput. Complex., TR07
R. Gurjar, A. Korwar, N. Saxena, N. Thierauf (2015)
Deterministic identity testing for sum of read-once oblivious arithmetic branching programsProceedings of the 30th Conference on Computational Complexity (CCC’15)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena (2011)
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
Nitin Saxena (2008)
Diagonal Circuit Identity Testing and Lower BoundsElectron. Colloquium Comput. Complex., TR07
Amir Shpilka, Ilya Volkovich (2008)
Read-once polynomial identity testingcomputational complexity, 24
R. Zippel (1979)
Probabilistic algorithms for sparse polynomials
Ilya Volkovich (2014)
Characterizing Arithmetic Read-Once FormulaeACM Trans. Comput. Theory, 8
R. Gurjar, A. Korwar, Nitin Saxena, T. Thierauf (2014)
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programscomputational complexity, 26
R. Lipton, Nisheeth Vishnoi (2003)
Deterministic identity testing for multivariate polynomials
N. Kayal, Shubhangi Saraf (2009)
Blackbox Polynomial Identity Testing for Depth 3 Circuits2009 50th Annual IEEE Symposium on Foundations of Computer Science
C. Lund, L. Fortnow, H. Karloff, N. Nisan (1990)
Algebraic methods for interactive proof systemsProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
R. DeMillo, R. Lipton (1978)
A Probabilistic Remark on Algebraic Program TestingInf. Process. Lett., 7
N. Bshouty, T. Hancock, L. Hellerstein (1992)
Learning arithmetic read-once formulas
In this article, we study the identity testing problem of arithmetic read-once formulas (ROFs) and some related models. An ROF is a formula (a circuit whose underlying graph is a tree) in which the operations are +, and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box setting for ROFs, as well as some other related models. As an application, we obtain the first polynomial-time deterministic reconstruction algorithm for such formulas. Our results are obtained by improving and extending the analysis of the algorithm of Shpilka and Yolkovich [51].
ACM Transactions on Computation Theory (TOCT) – Association for Computing Machinery
Published: May 23, 2018
Keywords: Arithmetic circuit
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.