Abstract
The communication complexity is an abstract complexity measure intensively investigated in the last few years. Since it provides lower bounds on the area (A) and area time squared (AT 2) complexity measures of VLSI computations, the main interest is in proving lower bounds on communication complexity of specific languages. We present a new combinatorial technique in order to establish a nontrivial lower bound on communication complexity of a specific language. Our lower bound provides the first, constructive proof of the fact, that communication complexity is strongly unclosed under union and intersection, and (what is the main point) this lower bound proves that AT 2 and A complexity of VLSI circuits is strongly unclosed under their Boolean operations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
AHO,A.V. — ULLMAN,J.D. — YANAKAKIS,M.: On notions of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, ACM 1983, pp. 133–139.
ĎUPIŠ,P. — GALIL,Z. — SCHNITGER,G.: Lower bounds on communication complexity. In: Proc. 16th ACM Symp. on Theory of Computing, ACM 1984,pp.81–91.
GUBAŠ,X. — WACZULÍK,J.: Closure properties of the complexity measures A and AT2. ŠVOČ 1987, section VLSI and computer graphics. Comenius University, Bratislava 1987, (in Slovak) 25 p.
HAJNAL,A. — MAASS,W. — TURAN,G.: On the communication complexity of graph properties. In: Proc. 20th Annual ACM STOC, ACM 1988, pp. 186–191.
HARPER, L.H.: Optimal numbering and isoperimetrical problems on graphs. Journ. of combinatorial theory, 1966, v. 1, no. 1 pp. 385–393.
HROMKOVIČ,J.: Lower bound techniques for VLSI algorithms. In: Proc. IMYCS'86, Hungarian Academy of Sciences, Budapest 1986, pp. 9–19. (also in: Treds, Techniques, and Problems in Theoretical Computer Science (Alica Kelemenová Jozef Kelemen Eds.), Lecture Notes in Computer Science 281, Springer-Verlag, Berlin 1987, pp.2–25.)
HROMKOVIČ,J.: Same complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits. Computers and Artificial Intelligence, Vol. 7, 1988, No. 3, 229–252 pp.
HROMKOVIČ,J.: Some complexity aspects of VLSI computations. Part 2. Topology of circuits and information transfer. Computers and Artificial Intelligence, Vol. 7, 1988, No. 4, 289–302 pp.
HROMKOVIČ,J. — PARDUBSKÁ,D.: Same complexity aspects of VLSI computations. Part 3. On the power of input bit permutation in tree and trellis automata. Computers and Artificial Intelligence, Vol. 7, 1988, No. 5, 397–412 pp.
HROMKOVIČ,J. — PARDUBSKÁ,D.: Same complexity aspects of VLSI computations. Part 4. VLSI circuits with programs. Computers and Artificial Intelligence, Vol. 7, 1988, No. 6, 481–495 pp.
HROMKOVIČ,J.: Same complexity aspects of VLSI computations. Part 5. Nondeterministic and probabilistic VLSI circuits. Computers and Artificial Intelligence, Vol. 8, 1989, No. 2, 169–188 pp.
HROMKOVIČ,J: Same complexity aspects of VLSI computations. Part 6. Communication complexity. Computers and Artificial Intelligence, Vol. 8, 1989, No. 3, 209–255 pp.
HROMKOVIČ, J.: The advantages of new approach to defining the communication complexity for VLSI. In: Theoretical Computer Science 57, 1988, pp. 97–111.
JIRÁSKOVÁ, G.: Chomski hierarchy and communication complexity. In: Machines, Languages and Complexity. Lecture Notes in Computer Science 381, Springer-Verlag, Berlin 1989, pp.12–18.
KURCABOVÁ,V.: Communication complexity. Master thesis, Dept. of Theoretical Cybernetics, Comenius University 1985 (in Slovak) 60 p.
LIPTON,R.J. — SEDGEWICK,R.: Lower bound for VLSI. In: Proc. 13th Annual ACM STOC, ACM 1981, pp. 300–307.
LOVÁSZ,L. — SAKS,M.: Lattices mobius functions and communication complexity. In: Proc. 29th Annual Symposium on FOCS 1988, pp. 81–90.
LOŽKIN,S.A. — RYBKO,A.I. — SAPOŽENkO,A.A. — HROMKOVIČ,J. — ŠKALIKOVA,N.A.: An approach to lower bound of area complexity of Boolean circuits. In: Mathematical problems in computation theory, Banach Center Publication, Vol. 21, PWN Polish Scientific Publishers, Warsaw 1988 pp. 503–512 (in Russian), extended version in English accepted for publication in Theoretical Computer Science.
PAPADIMITRIOU, C.H. — SIPSER, M.: Communication complexity. J. Comp. Syst. Sci., Vol. 28, 1984, pp. 260–269.
THOMPSON,C.D.: Area-time complexity for VLSI. In: Proc. 11th Annual ACM STOC, ACM 1979, pp. 81–88.
WEGENER,I.: The Complexity of Boolean Functions. John Wiley & Sons and B. G. Teubner 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waczulík, J. (1990). Area time squared and area complexity of VLSI computations is strongly unclosed under union and intersection. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_51
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive