Agrawal, Manindra; Saha, Chandan; Saxena, Nitin Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas. (English) Zbl 1293.94140 Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 321-330 (2013). Cited in 3 ReviewsCited in 14 Documents MSC: 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) 68W30 Symbolic computation and algebraic computation Keywords:Hadamard algebra; hitting-set; identity testing; low-support rank concentration; set-multilinear formula Citations:Zbl 1205.68175; Zbl 0938.68646; Zbl 1286.68489 PDFBibTeX XMLCite \textit{M. Agrawal} et al., in: Proceedings of the 45th annual ACM symposium on theory of computing, STOC '13. Palo Alto, CA, USA, June 1--4, 2013. New York, NY: Association for Computing Machinery (ACM). 321--330 (2013; Zbl 1293.94140) Full Text: DOI arXiv