Multilinearity Can Be Exponentially Restrictive (Preliminary Version)

[1]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[2]  Mark Jerrum,et al.  Some Exact Complexity Results for Straight-Line Computations over Semirings , 1982, JACM.

[3]  Avi Wigderson,et al.  The Complexity of Graph Connectivity , 1992, MFCS.

[4]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[5]  M. Sipser,et al.  Monotone Separation of Logspace from NC. , 1991 .

[6]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[7]  Éva Tardos,et al.  The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..

[8]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[9]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[10]  H. Venkateswaran.  Circuit Definitions of Nondeterministic Complexity Classes , 1992, SIAM J. Comput..

[11]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[12]  Andrew Chi-Chih Yao,et al.  A lower bound for the monotone depth of connectivity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..