Bounded-depth circuits: Separating wires from gates

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 257-265

  Koucký, Michal ^a,b   Pudlák, Pavel ^b   Thérien, Denis ^c  

^a CWI   (Netherlands)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Communication complexity; Constant depth circuits; Gates; Lower bounds; Regular languages; Wires

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; GATES (TRANSISTOR);

COMMUNICATION COMPLEXITY; CONSTANT-DEPTH CIRCUITS; GATES; LOWER BOUNDS; WIRES;

CIRCUIT THEORY;

EID: 34247479597     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Almeida. Finite Semigroups and Universal Algebra. World Scientific, 1994.
2. 1. Journal of Computer and System Sciences, 44(3):478-499, 1992.
3. G. Bilardi and F. P. Preparata. Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J. Computing, 19(2):246-255, 1990.
4. H. Buhrman. Personal communication. Dagstuhl, 2004.
5. A. K. Chandra, S. Fortune, and R. J. Lipton. Lower bounds for constant depth circuits for prefix problems. In Proc. of the 10th Intl. Colloquium on Automata, Languages and Programming, pages 109-117, 1983.
6. A. K. Chandra, S. Fortune, and R. J. Lipton. Unbounded fan-in circuits and associative functions. Journal of Computer and System Sciences, 30:222-234, 1985.
7. D. Dolev, C. Dwork, N. Pippenger, and A. Wigderson. Superconcentrators, generalizers and generalized connectors with limited depth (preliminary version). In Proceedings of STOC, pages 42-51, 1983.
8. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
9. P. Pudlák. Communication in bounded depth circuits. Combinatorica, 14(2):203-216, 1994.
10. P. Ragde and A. Wigderson. Linear-size constant-depth polylog-threshold circuits. Information Processing Letters, 39:143-146, 1991.
11. T. Schwentick, D. Thérien, and H. Vollmer. Partially ordered two-way automata: a new characterization of DA. In Proceedings of DLT, pages 242-253, 2001.
12. J. Sgall. Personal communication. Praha, 2004.
13. P. Tesson and D. Thérien. Complete classifications for the communication complexity of regular languages. In Proceedings of STAGS, pages 62-73, 2003.