Abstract
We treat the problem of parallel evaluation of two important classes of circuits: polynomial degree circuits, and leveled monotone planar circuits. We show that if the operators form a non-commutative semi-ring, then there exists a circuit of degree 0(n) and size 0(n) for which the minimum depth after any restructuring is n. We also establish that any leveled monotone planar boolean circuit of size n can be evaluated by poly(n) processors in 0(log 3 n) parallel time.
Supported by NSF Grant #CCR-8804284 and NSF DARPA Grant #CCR-8908092
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. W. Dymond, and S. A. Cook: Hardware Complexity and Parallel Computation, Proceedings of the 21st Annual Symp. on Foundations of Computer Science, 1980, 360–372.
L. M. Goldschlager: A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem, IPL, 1980, 25–27.
L. M. Goldschlager, and I. Parberry: On the Construction of Parallel Computers from Various Bases of Boolean Functions, Theoretical Computer Science, 1986, 43–58.
R. E. Ladner: The Circuit Value Problem is log space complete for P, SIGACT News 7, 1975, 18–20.
G. L. Miller, V. Ramachandran, and E. Kaltofen: Efficient Parallel Evaluation of Straight-line Code and Arithmetic Circuits, Lecture Notes in Computer Science 227, VLSI Algorithms and Architectures, 1986, 236–245.
L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff: Fast Parallel Computation of Polynomials Using Few Processors, SIAM J. on Computing, 1983, 641–644.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosaraju, S.R. (1990). On the parallel evaluation of classes of circuits. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_48
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive