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.
Cite
CITATION STYLE
Venkateswaran, H. (1988). Circuit definitions of nondeterministic complexity classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 338 LNCS, pp. 175–192). Springer Verlag. https://doi.org/10.1007/3-540-50517-2_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
