Circuit Definitions of Nondeterministic Complexity Classes

This paper considers restrictions on Boolean circuits and uses them to obtain new uniform circuit characterizations of nondeterministic space and time classes. It also obtains characterizations of counting classes based on nondeterministic time bounded computations on the arithmetic circuit model. I...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on computing Ročník 21; číslo 4; s. 655 - 670
Hlavný autor: Venkateswaran, H.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1992
Predmet:
Applied sciences
Arithmetic
Boolean
Boolean algebra
Circuits
Codes
Complexity
Complexity theory
Computer science
Constrictions
Exact sciences and technology
Flows in networks. Combinatorial problems
Language
Mathematics
Operational research and scientific management
Operational research. Management science
Complexity class
Arithmetic circuit
Combinatorics
Boolean circuit
Turing machine
ISSN:0097-5397, 1095-7111
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper considers restrictions on Boolean circuits and uses them to obtain new uniform circuit characterizations of nondeterministic space and time classes. It also obtains characterizations of counting classes based on nondeterministic time bounded computations on the arithmetic circuit model. It is shown how the notion of semi-unboundedness unifies the definitions of many natural complexity classes.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/0221040