Improved Hitting Set for Orbit of ROABPs
- 12 October 2022
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 31 (2) , 1-45
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Algebraic independence and blackbox identity testingInformation and Computation, 2013
- An Almost Optimal Rank Bound for Depth-3 IdentitiesSIAM Journal on Computing, 2011
- 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
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 CircuitsSIAM Journal on Computing, 2007
- PRIMES is in PAnnals of Mathematics, 2004
- A bijective proof of Muir's identity and the Cauchy-Binet formulaLinear Algebra and its Applications, 1993
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A probabilistic remark on algebraic program testingInformation Processing Letters, 1978
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947