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 条
  • [41] Unweaving the Definitions of Complexity
    Beale, Dean
    Dazzi, Francesco
    Tryfonas, Theo
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (02): : 682 - 692
  • [42] Nondeterministic Complexity of Operations on Closed and Ideal Languages
    Hospodar, Michal
    Jiraskova, Galina
    Mlynarcik, Peter
    [J]. Implementation and Application of Automata, 2016, 9705 : 125 - 137
  • [43] Nondeterministic Communication Complexity of Random Boolean Functions
    Pourmoradnasseri, Mozhgan
    Theis, Dirk Oliver
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2017), 2017, 10185 : 528 - 541
  • [44] Complexity of nondeterministic algorithms for front constrained problems
    Lepin, VV
    [J]. DOKLADY AKADEMII NAUK BELARUSI, 1996, 40 (03): : 21 - 25
  • [45] Complexity of Verification of Nondeterministic Probabilistic Multiagent Systems
    Valiev, M. K.
    Dekhtyar, M. I.
    [J]. AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2011, 45 (07) : 390 - 396
  • [46] Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
    Pitassi, Toniann
    Shirley, Morgan
    Watson, Thomas
    [J]. COMPUTATIONAL COMPLEXITY, 2021, 30 (02)
  • [47] Operations on Subregular Languages and Nondeterministic State Complexity
    Hospodar, Michal
    Mlynarcik, Peter
    Olejar, Viktor
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 112 - 126
  • [48] Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
    Toniann Pitassi
    Morgan Shirley
    Thomas Watson
    [J]. computational complexity, 2021, 30
  • [49] A NOTE ON DETERMINISTIC AND NONDETERMINISTIC TIME-COMPLEXITY
    EVEN, S
    LONG, TJ
    YACOBI, Y
    [J]. INFORMATION AND CONTROL, 1982, 55 (1-3): : 117 - 124
  • [50] Nondeterministic Instance Complexity and Proof Systems with Advice
    Beyersdorff, Olaf
    Koebler, Johannes
    Mueller, Sebastian
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 164 - +
12345