CIRCUIT DEFINITIONS OF NONDETERMINISTIC COMPLEXITY CLASSES

被引：34
|
作者：
VENKATESWARAN, H
机构：
[1] Georgia Inst of Technology, Atlanta, GA
来源：
SIAM JOURNAL ON COMPUTING | 1992年 / 21卷 / 04期
关键词：
BOOLEAN CIRCUITS; ARITHMETIC CIRCUITS; NP; P; SKEW CIRCUITS; SEMIUNBOUNDEDNESS;
D O I：
10.1137/0221040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：655 / 670
页数：16
相关论文
共 50 条
12345