Monotone separation of logspace from NC/sup 1/
暂无分享,去创建一个
[1] M. Sipser,et al. Monotone complexity , 1992 .
[2] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[3] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..
[4] A. Razborov. Lower bounds on monotone complexity of the logical permanent , 1985 .
[5] Andrew Chi-Chih Yao. Circuits and local computation , 1989, STOC '89.
[6] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..
[7] Yuri Gurevich,et al. Monotone versus positive , 1987, JACM.
[8] Ran Raz,et al. Probabilistic communication complexity of Boolean relations , 1989, 30th Annual Symposium on Foundations of Computer Science.