Circuit definitions of nondeterministic complexity classes
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 175-192
- https://doi.org/10.1007/3-540-50517-2_80
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- PrefaceInformation and Control, 1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- Hardware complexity and parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- On simultaneous resource boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- The circuit value problem is log space complete for PACM SIGACT News, 1975