LANGUAGES THAT CAPTURE COMPLEXITY CLASSES

被引：298
|
作者：
IMMERMAN, N
机构：
[1] Yale Univ, New Haven, CT, USA, Yale Univ, New Haven, CT, USA
来源：
SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 04期
关键词：
COMPLEXITY CLASSES - COMPUTATIONAL COMPLEXITY - FIRST-ORDER EXPRESSIBILITY - FIRST-ORDER LOGIC;
D O I：
10.1137/0216051
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：760 / 778
页数：19
相关论文
共 50 条
  • [41] Dimension in complexity classes
    Lutz, JH
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 158 - 169
  • [42] Classes of complexity in manufacturing
    Calinescu, A
    Efstathiou, J
    Huatuco, LH
    Sivadasan, S
    ADVANCES IN MANUFACTURING TECHNOLOGY - XV, 2001, : 351 - 356
  • [43] CLASSES OF COMPLEXITY AND CLASSES OF SIGNALING COMPUTABLE FUNCTIONS
    MATROSOV, VL
    DOKLADY AKADEMII NAUK SSSR, 1976, 226 (03): : 513 - 515
  • [44] ASSOCIATE LANGUAGES AND DERIVATIONAL COMPLEXITY OF FORMAL GRAMMARS AND LANGUAGES
    MORIYA, E
    INFORMATION AND CONTROL, 1973, 22 (02): : 139 - 162
  • [45] On computational complexity of contextual languages
    Ilie, L
    THEORETICAL COMPUTER SCIENCE, 1997, 183 (01) : 33 - 44
  • [46] Circuit complexity of regular languages
    Koucky, Michal
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 426 - 435
  • [47] On the cover complexity of finite languages
    Hetzl, Stefan
    Wolfsteiner, Simon
    THEORETICAL COMPUTER SCIENCE, 2019, 798 : 109 - 125
  • [48] Classical languages, complexity and skills
    Mangiavini, Marialetizia
    Bettoni, Marcello
    INTERACTION DESIGN AND ARCHITECTURES, 2009, (7-8) : 48 - 50
  • [49] Circuit Complexity of Regular Languages
    Koucky, Michal
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 865 - 879
  • [50] On the Grammatical Complexity of Finite Languages
    Holzer, Markus
    Wolfsteiner, Simon
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 151 - 162
12345