Certifying polynomials for AC^0(parity) circuits, with applications
暂无分享,去创建一个
[1] Michael Ben-Or,et al. A theorem on probabilistic constant depth Computations , 1984, STOC '84.
[2] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[3] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4] Jaikumar Radhakrishnan,et al. Deterministic restrictions in circuit complexity , 1996, STOC '96.
[5] R. Smolensky. On representations by low-degree polynomials , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[6] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[7] Miklós Ajtai,et al. Approximate Counting with Uniform Constant-Depth Circuits , 1990, Advances In Computational Complexity Theory.
[8] James Aspnes,et al. The expressive power of voting polynomials , 1994, Comb..
[9] Diederich Hinrichsen,et al. Mathematical Systems Theory I , 2006, IEEE Transactions on Automatic Control.
[10] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[11] Emanuele Viola. On Approximate Majority and Probabilistic Time , 2009, computational complexity.
[12] Avi Wigderson,et al. Linear-Size Constant-Depth Polylog-Treshold Circuits , 1991, Inf. Process. Lett..
[13] Alexander A. Razborov,et al. Natural Proofs , 1997, J. Comput. Syst. Sci..
[14] Benjamin Rossman,et al. On the constant-depth complexity of k-clique , 2008, STOC.
[15] Kazuyuki Amano. k-Subgraph Isomorphism on AC0 Circuits , 2009, Computational Complexity Conference.