Abstract
We consider planar circuits, formulas and multilective planar circuits. It is shown that planar circuits and formulas are incomparable. An Ω(n logn) lower bound is given for the multilective planar circuit complexity of a decision problem and an Ω(n 3/2) lower bound is given for the multilective planar circuit complexity of a multiple output function.
Similar content being viewed by others
References
N. Alon andW. Maass, Meanders and their application in lower bounds arguments.J. Comput. System Sci. 37 (1988), 118–129.
A. E. Andreev, On a method giving larger than quadratic effective lower bounds for the complexity of π-schemes.Vestnik Moscow Univ. Ser. 1 (Math. Mech.) 6, 1986, 73–76. (In Russian.)
L. Babai, N. Nisan, andM. Szegedy, Multiparty protocols, pseudorandom generators for Logspace and time-space trade-offs.J. Comput. System Sci. 45 (1992), 204–232.
L. Babai, P. Pudlák, V. Rödl, andE. Szemerédi, Lower bounds to the complexity of symmetric Boolean functions.Theoret. Comput. Sci. 74 (1990), 313–323.
S. N. Bhatt andF. T. Leighton, A framework for solving VLSI graph layout problems.J. Comput. System Sci. 28(1984), 300–343.
O. Gabber, Z. Galil, Explicit construction of linear size superconcentrators.J. Comput. System Sci. 22 (1981), 407–420.
H. D. Gröger, A new partition lemma for planar graphs and its application to circuit complexity. InProceedings FCT 1991, ed.L. Budach,Lecture Notes in Computer Science 529, Springer-Verlag, 1991, 220–229.
P. Hochschild, Multiple cuts, input repetition, and VLSI complexity.Inform. Process. Lett. 24 (1987), 19–24.
Z. M. Kedem, Optimal allocation of computational resources in VLSI. InProc. 23rd Ann. IEEE Symp. Found. Comput. Sci., 1982, 379–385.
Z. M. Kedem andA. Zorat, Replication of inputs may save computational resources in VLSI. InVLSI Systems and Computations, ed.H. T. Kung, R. Sproull, andG. Steele. Comput. Sci. Press, Rockwille MD, 1981, 52–60.
Z. M. Kedem and A. Zorat, On relations between input and communication/computation in VLSI. InProc. 22nd Ann. IEEE Symp. Found. Comput. Sci., 1981, 37–41.
R. J. Lipton and R. Sedgewick, Lower bounds for VLSI. InProc. Thirteenth Ann. ACM Symp. Theor. Comput., 1981, 300–307.
R. J. Lipton andR. E. Tarjan, A planar separator theorem.SIAM J. Appl. Math. 36 (1979), 177–189.
R. J. Lipton andR. E. Tarjan, Applications of a planar separator theorem.SIAM J. Comput. 9 (1980), 615–626.
W. Maass, G. Schnitger, and E. Szemerédi, Two tapes are better than one for off-line Turing machines. InProc. Nineteenth Ann. ACM Symp. Theor. Comput., 1987, 94–100.
W. Maass, G. Schnitger, E. Szemerédi, G. Turán, Two tapes versus one for off-line Turing machines.Comput complexity 3 (1993), 392–401.
W. F. McColl, Planar crossovers.IEEE Trans. Comput. 30 (1981), 223–225.
W. F. McColl, On the planar monotone computation of threshold functions. InProc. 2nd Symp. Theoret. Aspects of Comput. Sci., ed.K. Mehlhorn,Lecture Notes in Computer Science 182, Springer-Verlag, 1985, 219–230.
W. F. McColl, Planar circuits have short specifications. InProc. 2nd Symp. Theoret. Aspects of Comput. Sci., ed.K. Mehlhorn,Lecture Notes in Computer Science 182, Springer-Verlag, 1985, 231–242.
W. F. McColl, M. S. Paterson, The planar realization of Boolean functions.Inform. Process. Lett. 24 (1987), 165–170.
E. J. Nechiporuk, A Boolean function.Dokl. Akad. Nauk SSSR 169 (1966), 765–766.
W. J. Paul, A 2.5n lower bound on the combinational complexity of Boolean functions.SIAM J. Comput. 6 (1977), 427–443.
J. E. Savage, Planar circuit complexity and the performance of VLSI algorithms. InVLSI Systems and Computations, ed.H. T. Kung, R. Sproull, andG. Steele. Comput. Sci. Press Rockwille MD, 1981, 61–67. Also in INRIA Report77 (1981).
J. E. Savage, The performance of multilective VLSI algorithms.J. Comput. System Sci. 29 (1984), 243–272.
G. Turán, Lower bounds for synchronous circuits and planar circuits.Inform. Process. Lett. 30 (1989), 37–40.
G. Turán, On restricted Boolean circuits. InProceedings FCT 1989, ed.J. Csirik, J. Demetrovics, and F. Gécseg,Lecture Notes in Computer Science 380, Springer-Verlag, 1989, 460–469.
J. D. Ullman,Computational Aspects of VLSI. Comput. Sci. Press, Rockwille MD, 1984.
J. Vuillemin, A combinatorial limit to the computing power of VLSI circuits.IEEE Trans. Comput. 32 (1983), 294–300.
I. Wegener, The Complexity of Boolean Functions.Wiley-Teubner Series in Comput. Sci., 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Turán, G. On the complexity of planar Boolean circuits. Comput Complexity 5, 24–42 (1995). https://doi.org/10.1007/BF01277954
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01277954