Author:
Hansen Kristoffer Arnsfelt,Podolskii Vladimir V.
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.J.: Polynomials that sign represent parity and Descartes’ rule of signs. Computat. Complex. 17(3), 377–406 (2008)
2. Beigel, R.: The polynomial method in circuit complexity. In: CCC 1993, pp. 82–95. IEEE Computer Society Press (1993)
3. Beigel, R.: Perceptrons, PP, and the polynomial hierarchy. Comput. Complex. 4(4), 339–349 (1994)
4. Bruck, J., Smolensky, R.: Polynomial threshold functions, AC0 functions, and spectral norms. SIAM J. Comput. 21(1), 33–42 (1992)
5. Buhrman, H., Vereshchagin, N.K., de Wolf, R.: On computation and communication with small bias. In: CCC 2007, pp. 24–32 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献