SOME MORE INDEPENDENCE RESULTS IN COMPLEXITY THEORY

被引：1
|
作者：
GRANT, PW
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1980年 / 12卷 / 02期
关键词：
D O I：
10.1016/0304-3975(80)90024-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：119 / 126
页数：8
相关论文
共 50 条
  • [41] Some complexity results for polynomial rational expressions
    Héam, PC
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 735 - 741
  • [42] SOME RESULTS ON UNIFORM ARITHMETIC CIRCUIT COMPLEXITY
    FRANDSEN, GS
    VALENCE, M
    BARRINGTON, DAM
    MATHEMATICAL SYSTEMS THEORY, 1994, 27 (02): : 105 - 124
  • [43] STRENGTHENING SOME COMPLEXITY RESULTS ON TOUGHNESS OF GRAPHS
    Katona, Gyula Y.
    Varga, Kitti
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (02) : 401 - 419
  • [44] Some results on the expressive power and complexity of LSCs
    Harel, David
    Maoz, Shahar
    Segall, Itai
    PILLARS OF COMPUTER SCIENCE, 2008, 4800 : 351 - 366
  • [45] SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY
    FELDMAN, J
    INFORMATION AND CONTROL, 1972, 20 (03): : 244 - &
  • [46] Some complexity results for System Verilog Assertions
    Bustan, Doron
    Havlicek, John
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2006, 4144 : 205 - 218
  • [47] Complexity Results for Some Global Optimization Problems
    M. Locatelli
    Journal of Optimization Theory and Applications, 2009, 140 : 93 - 102
  • [48] Some complexity results for stateful network verification
    Kalev Alpernas
    Aurojit Panda
    Alexander Rabinovich
    Mooly Sagiv
    Scott Shenker
    Sharon Shoham
    Yaron Velner
    Formal Methods in System Design, 2019, 54 : 191 - 231
  • [49] Some results on the complexity of planning with incomplete information
    Haslum, P
    Jonsson, P
    RECENT ADVANCES IN AI PLANNING, 2000, 1809 : 308 - 318
  • [50] COMPLEXITY OF SOME PROBLEMS FROM THE THEORY OF AUTOMATA
    STERN, J
    INFORMATION AND CONTROL, 1985, 66 (03): : 163 - 176
12345