Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1991: Fundamentals of Computation Theory pp 240–247Cite as

Nonlinear lower bounds on the number of processors of circuits with sublinear separators

  • Commanications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 529))

Abstract

It is proved that each unbounded fan-in, fan-out Boolean circuit with O(n a)-separator for an a<1 must have Ω(n 1/a) processors to compute some specific one-output Boolean functions. A nonlinear lower bound on the number of processors is achieved also for planar VLSI circuits computing some one-output Boolean functions in time O(n b) for b<1/2.

(extended abstract)

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V. — Ullman, J.D. — Yanakakis, M.: On notions of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, ACM 1983, 133–139.

    Google Scholar 

  2. Alon, N.: Eigenvalues and expanders. Combinatorica 6, 1986, 85–95.

    Google Scholar 

  3. Blum, N.: A Boolean function requiring 3n network size. Theoretical Computer Science 28, 1984, 337–345.

    Google Scholar 

  4. Harper, L.H. — Savage, J.E.: Complexity made Simple. In: Proc. of the Intern. Symp. on Combinatorial Theory, Rome, Sept. 1973, 2–15.

    Google Scholar 

  5. Harper, L.H. — Hsieh, W.N. — Savage, J.E.: A class of Boolean functions with linear combinational complexity. Theoretical Computer Science, Vol. 1, No. 2, 1975, 161–183.

    Google Scholar 

  6. Hromkovič, J.: The advantages of a new approach to defining the communication complexity for VLSI. Theor. Comp. Science 57, 1988, 97–111.

    Google Scholar 

  7. Hromkovič, J.: Some complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits. Computers and Artificial Intelligence 7, No. 3, 1988, 229–252.

    Google Scholar 

  8. Hromkovič, J.: Some complexity aspects of VLSI computations. Part 6. Communication complexity. Computers AI 8, No. 3, 1989, 209–225.

    Google Scholar 

  9. Kumičáková-Jirásková, G.: Chomsky hierarchy and communication complexity. J. Inf. Process. Cybern. EIK 25, No. 4, 1989, 157–164.

    Google Scholar 

  10. Kloss, B.M. — Malyshev, V.A.: Bounds on complexity of some classes of functions. Vest. Mosk. Univ., Seria matem., mech., 1965, No. 4, 44–51 (in Russian).

    Google Scholar 

  11. Lipton, R.J. — Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 1979, No. 2, 177–189.

    Google Scholar 

  12. Lipton, R.J. — Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. on Comp. 9, 1980, 615–627.

    Google Scholar 

  13. Ložkin, C.A. — Rybko, A.N. — Sapoženko, A.A. — Hromkovič, J. — Škalikova, N.A.: On a approach to a bound on the area complexity of combinational circuits. In: Mathematical problems in computation theory. Banach Center Publications, Warsaw, 1988, 501–510. (in Russian), the extended version of this paper is submitted to Theor. Comp. Sci.

    Google Scholar 

  14. Lupanov, O.B.: Ob odnom metode sinteza skhem. Izv. VUZ (Radiofizika) 1, 1958, 120–140. (in Russian)

    Google Scholar 

  15. McColl, B.: On the planar monotone computation of threshold functions. In: Proc. 2nd STACS'85, Lecture Notes in Computer Science 182, Springer-Verlag 1985, 219–230.

    Google Scholar 

  16. McColl, B.: Planar circutis have short specifications. In: Proc. 2nd STACS'85, Lecture Notes in Computer Science 1982, Springer-Verlag 1985, 231–242.

    Google Scholar 

  17. McColl, B. — Paterson, M.S.: The planar realization of Boolean functions. Technical Report, University Warwick 1984.

    Google Scholar 

  18. Paul, W.J.: A 2.5n — lower bound on the combinational complexity of Boolean functions. SIAM J. Comput. 6, 1977, 427–443.

    Google Scholar 

  19. Papadimitriou, Ch. — Sipser, M.: Communication complexity. J. Computer System Sci. 28, 1984, 260–269.

    Google Scholar 

  20. Redkin, N.P.: Proof of minimality of circuits consisting of functional elements. Problemy kibernetiki 38, 1981, 181–216. (in Russian)

    Google Scholar 

  21. Savage, J.E.: Planar circuit complexity and the performance of VLSI algorithms. In: VLSI Syst. and Comp., Computer Science Press 1981.

    Google Scholar 

  22. Schnorr, C.P.: Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13, 1974, 155–171.

    Google Scholar 

  23. Schnorr, C.P.: A 3 · n lower bound on the network complexity of Boolean functions. Theor. Comp. Science 10, 1980, 83–92.

    Google Scholar 

  24. Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell System Techn. J. 28, 1949, 59–98.

    Google Scholar 

  25. Soprunenko, E.P.: Minimal realizations of functions by circuits using functional elements. Probl. Kibernetiki 15, 1965, 117–134. (in Russian)

    Google Scholar 

  26. Stockmeyer, L.J.: On the combinational complexity of certain symmetric Boolean functions. Math. System Theory 10, 1977, 323–336.

    Google Scholar 

  27. Turán, G.: Lower bounds for synchronous circuits and planar circuits. Infor. Proc. Lett. 130, 1989, 37–40.

    Google Scholar 

  28. Ullman, J.: Computational Aspects of VLSI. Principles of Computer Science Series. Computer Science Press 1984.

    Google Scholar 

  29. Wegener, I.: The Complexity of Boolean functions. Wiley-Teubner Series in Computer Science, John Wiley and Sons Ltd., and B.G. Teubner, Stuttgart 1987.

    Google Scholar 

  30. Yao, A.C.: The entropic limitation of VLSI computations. In: Proc. 13th Annual ACM Symp. on Theory of Computing, ACM 1981, 308–311.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Comenius University, 842 15, Bratislava, Czechoslovakia

    Juraj Hromkovič

  2. FB 17 Mathematik-Informatik, Universität-GH Paderborn, D-4790, Paderborn, Germany

    Juraj Hromkovič

Authors
  1. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J. (1991). Nonlinear lower bounds on the number of processors of circuits with sublinear separators. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-54458-5_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54458-6

  • Online ISBN: 978-3-540-38391-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation