Abstract
We consider restictions on Boolean circuits and use them to obtain new uniform circuit characterizations of nondeterministic space and time classes. We also obtain characterizations of counting classes based on nondeterministic time bounded computations on the arithmetic circuit model. It is shown how the notion of semiunboundedness unifies the definitions of many natural complexity classes.
This material is based upon work supported by the National Science Foundation under grant CCR-8711749. This work was done while the author was at the school of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia 30332-0280, USA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Borodin, A., On Relating Time and Space to Size and Depth, SIAM Journal of Computing 6, (1977), 733–743.
Borodin, A., S.A. Cook, P.W. Dymond, W.L. Ruzzo, and M. Tompa, Two Applications of Complementation via Inductive Counting, University of Washington Technical Report 87-10-01, October 1987.
Cook, S.A., Deterministic CFL's are accepted simultaneously in polynomial time and log squared space, Proc. 11th Annual. ACM Symposium on Theory of Computing, (1979), 338–345.
Cook, S.A., A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64, 1–3 (Jan/Feb/Mar 1985), 2–22.
Dymond, P.W. and S.A. Cook, Hardware Complexity and Parallel Computation, Proc. 21st Annual Symposium on Foundations of Computer Science, Toronnto, 1980.
Goldschlager, L.M., The Monotone and Planar Circuit Value Problems are log space Complete for P, SIGACT News 9, 2, 1977, 25–29.
Ladner, R.E., The Circuit Value Problem is log space Complete for P, SIGACT News 7, 1, 1975, 18–20.
Papadimitriou, C.H., M. Yannakakis, The Complexity of Facets (and some Facets of Complexity), Journal of Computer and System Science 28, (1984), 244–259.
Pippenger, N., On Simultaneous Resource Bounds, Proc. 20th Annual Symposium on Foundations of Computer Science, Puerto Rico, 1979.
Pippenger, N., and M.J. Fischer, Relations among Complexity Measures, Journal of the Association for Computing Machinery 26, (1979), 361–381.
Ruzzo, W.L., Tree-Size Bounded Alternation, Journal of Computer and System Sciences 20, (1980), 218–235.
Ruzzo, W.L., On Uniform Circuit Complexity, Journal of Computer and System Sciences 22, (1981), 365–383.
Stockmeyer, L. and U. Vishkin, Simulation of Parallel Random Acces Machines by Circuits, SIAM Journal of Computing 13, (1984), 409–422.
Venkateswaran, H., Properties that Characterize LOGCFL, Proc. 19th Annual ACM Symposium on Theory of Computing, (1987), 141–150.
Venkateswaran, H. and M. Tompa, A New Pebble Game that Characterizes Parallel Complexity Classes, Proc. 27th Annual Symposium on Foundations of Computer Science, Toronto, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venkateswaran, H. (1988). Circuit definitions of nondeterministic complexity classes. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_80
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive