Remarks on graph complexity (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 307-319

  Lokam, Satyanarayana V ^a  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHOD; BIPARTITE GRAPHS; BOOLEAN CIRCUIT; COMMUNICATION COMPLEXITY; EXTENDED ABSTRACTS; GRAPH COMPLEXITY; N-VERTEX GRAPH; SPECIAL CLASS;

ALGEBRA; HADAMARD MATRICES; SOFTWARE ENGINEERING;

GRAPH THEORY;

EID: 84887042389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_29     Document Type: Conference Paper

References (28)

1. Alon, N., Boppana, R. : The Monotone Circuit Complexity of Boolean Functions, Combinatorica, 7(1) 1987, pp. 1-22. 307
2. Babai, L., Frankl, P., Simon, J. : Complexity classes in Communication Complexity Theory, 26th IEEE FOCS, 1986, pp. 337-347. 308, 310, 313
3. Berkowitz, S. : On some Relationships Between Monotone and Nonmonotone Circuit Complexity, Technical Report, University of Toronto, 1982. 308
4. Bublitz, S. : Decomposition of Graphs and Monotone Formula size of Homogeneous Functions, Acta Informatika, 23, 1986, pp. 689-696. 312 (Pubitemid 17480874)
5. Dunne, P. : The Complexity of Central Slice Functions, Theoretical Computer Science, 44 (1986), pp. 247-257. 308
6. Friedman, J. : Constructing O(n log n) size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables, SIAM jl. Comp., 15(3) 1986, pp. 641-654. 314 (Pubitemid 16634094)
7. Håstad, J. : Almost Optimal Lower Bounds for Small Depth Circuits, in S. Micali (ed), Advances in Computer Research, Vol 5: Randomness and Computation, JAI Press, 1989. 307
8. Håstad, J., Jukna, S., Pudlák, P.: Top-Down Lower Bounds for Depth-3 Circuits, 34th IEEE FOCS, pp. 124-129. 310
9. Hayes, T., Kutin, S. : personal communication. 315
10. Nisan, N., Szegedy, M. : On the degree of Boolean Functions as Real Polynomials, 24th ACM STOC, 1991, pp. 462-467. 310, 315
11. Krause, M., Waack, S. : Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits having Symmetric Gates with Unbounded fan-in, 32nd IEEE FOCS, 1991, pp. 777-782. 310, 315
12. Karchmer, M., Wigderson, A. : Monotone Circuits for Connectivity require Sper-Logarithmic Depth, SIAM jl. Disc. Math. 3(2) 1990, pp. 255-265. 307
13. Pudlák, P., Rödl, V., Savický, P. : Graph Complexity, Acta Informatica, 25 (1988), pp. 515-535. 307, 308, 309, 311, 312
14. Pudlák, P., Rödl, V. : A Combinatorial Approach to Complexity, Combinatorica, 14 (1992), pp. 221-226. 308
15. Pudlák, P., Rödl, V. : Some Combinatorial-Algebraic Problems from Complexity Theory, Discrete Mathematics, 136 (1994), pp. 253-279. 308
16. Paturi, R., Saks, M., Zane, F. : Exponential Lower Bounds on Depth 3 Boolean Circuits, 29th ACM STOC, 1997, pp. 310
17. Paturi, R., Pudlák, P., Zane, F. : Satisfiability Coding Lemma, 38th IEEE FOCS, 1997, pp. 566-574. 310
18. Razborov, A. A. : Applications of Matrix Methods for the theory of Lower Bounds in Computational Complexity, Combinatorica, 10 (1990), pp. 81 -93. 308
19. Razborov, A. A. : Lower Bounds on the size of Bounded Depth Networks over a Complete Basis with Logical Addition, Mat. Zametki 4194) 1987, pp. 598-607 (in Russian), English translation in: Math. Notes 41(4)1987, pp. 333-338. 307
20. Razborov, A. A. : Lower Bounds on the Monotone Complexity of some Boolean Functions, Dokl. Akad. Nauk SSSR 281(4) 1985, pp. 798-801 (in Russian), English translation in: Soviet Math. Dokl. 31(1985), pp. 354-357. 307
21. Razborov, A. A. : A Lower Bound on the Monotone Network Complexity of the Logical Permanent, Mat. Zametki 37(6) 1985, pp. 887-900 (in Russian), English translation in: Math. Notes 37(6) 1985, pp. 485-493.
22. Raz, R., Wigderson, A. : Monotone Circuits for Matching require Linear Depth, JACM, 39(3) 1992, pp. 736-744. 307 (Pubitemid 23600391)
23. Raz, R., McKenzie, P. : Separation of the Monotone NC Hierarchy, 38th IEEE FOCS, 1997, pp. 234-243. 307
24. Smolensky, R. : Algebraic Methods in the theory of Lower Bounds for Boolean Circuit Complexity, 19th STOC, 1987, pp. 77-82. 307 (Pubitemid 18643393)
25. Tardos, E. : The gap between Monotone and Non-monotone Circuit Complexity is Exponential, Combinatorica, 8(1) 1988, pp. 141-142. 308
26. Wegener, I. : The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, (Teubner, Stuttgart/wiley, Chichester, 1987.)
27. Valiant, L. : Graph-Theoretical Methods in Low-level Complexity, 6th MFCS, LNCS vol. 53, Springer-Verlag, 1977, pp. 162-176. 310
28. Yao, A. : Some Complexity Questions related to Distributive Computing, 11th ACM STOC, 1979, pp. 209-213. 308