Monotone separations for constant degree polynomials
暂无分享,去创建一个
[1] Amir Yehudayoff,et al. Homogeneous Formulas and Symmetric Polynomials , 2011, computational complexity.
[2] Avi Wigderson,et al. Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[3] Mark Jerrum,et al. Some Exact Complexity Results for Straight-Line Computations over Semirings , 1982, JACM.
[4] Leslie G. Valiant,et al. Negation can be exponentially powerful , 1979, Theor. Comput. Sci..
[5] Ran Raz. Elusive functions and lower bounds for arithmetic circuits , 2008, STOC '08.
[6] Marc Snir,et al. On the depth complexity of formulas , 1979, Mathematical systems theory.
[7] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.