Read-once polynomial identity testing
- 27 May 2015
- journal article
- Published by Springer Nature in computational complexity
- Vol. 24 (3) , 477-532
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Arithmetic Circuits: A Survey of Recent Results and Open QuestionsFoundations and Trends® in Theoretical Computer Science, 2010
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic CircuitsSIAM Journal on Computing, 2010
- The ideal membership problem and polynomial identity testingInformation and Computation, 2009
- Multi-linear formulas for permanent and determinant are of super-polynomial sizeJournal of the ACM, 2009
- PRIMES is in PAnnals of Mathematics, 2004
- Learning Boolean Read-Once Formulas over Generalized BasesJournal of Computer and System Sciences, 1995
- Combinatorial characterization of read-once formulaeDiscrete Mathematics, 1993
- Learning read-once formulas with queriesJournal of the ACM, 1993
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A probabilistic remark on algebraic program testingInformation Processing Letters, 1978