Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In

[1]  Matthias Krause,et al.  On Oblivious Branching Programs of Linear Length , 1991, Inf. Comput..

[2]  Matthias Krause,et al.  Geometric arguments yield better bounds for threshold circuits and distributed computing , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[3]  Roman Smolensky.  On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  B. Huppert.  Angewandte lineare Algebra , 1990 .

[6]  Christoph Meinel,et al.  Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[7]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[8]  Noga Alon,et al.  Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

[9]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[11]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[12]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[13]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[14]  Noga Alon,et al.  Meanders, Ramsey theory and lower bounds for branching programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

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

[17]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[18]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[19]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).