The monotone Lambek calculus is NP-complete

被引：0
|
作者：
Pentus, Mati [1 ]
机构：
[1] Moscow State University, Moscow, Russia
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8222卷
关键词：
11;
D O I：
10.1007/978-3-642-54789-8_20
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：368 / 380
相关论文
共 50 条
  • [31] Entropy for NP-complete problems
    Levchenkov, V.S.
    Doklady Akademii Nauk, 2001, 376 (02) : 175 - 178
  • [32] Chained Block is NP-Complete
    Iwamoto, Chuzo
    Ide, Tatsuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (03) : 320 - 324
  • [33] The entropy of NP-complete problems
    Levchenkov, VS
    DOKLADY MATHEMATICS, 2001, 63 (01) : 130 - 132
  • [34] SPLITTING NUMBER is NP-complete
    Faria, L
    de Figueiredo, CMH
    Mendonça, CFX
    DISCRETE APPLIED MATHEMATICS, 2001, 108 (1-2) : 65 - 83
  • [35] Strategic Argumentation is NP-Complete
    Governatori, G.
    Olivieri, F.
    Scannapieco, S.
    Rotolo, A.
    Cristani, M.
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 399 - 404
  • [36] Decidability of NP-Complete Problems
    A. A. Vagis
    A. M. Gupal
    Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
  • [37] ON ONE NP-COMPLETE PROBLEM
    DEMEL, J
    DEMLOVA, M
    KYBERNETIKA, 1995, 31 (02) : 207 - 211
  • [38] System BV is NP-complete
    Kahramanogullari, Ozan
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 87 - 99
  • [39] Splitting NP-complete sets
    Glasser, Christian
    Pavan, A.
    Selman, Alan L.
    Zhang, Liyu
    SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1517 - 1535
  • [40] AN NP-COMPLETE MATCHING PROBLEM
    PLAISTED, DA
    ZAKS, S
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
12345