NP-HARD SETS AND CREATIVENESS OVER CONSTANT TIME LANGUAGES

被引：0
|
作者：
AGRAWAL, M
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 560卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：224 / 241
页数：18
相关论文
共 50 条
  • [41] (2+ε)-SAT is NP-hard
    Austrin, Per
    Guruswami, Venkatesan
    Hastad, Johan
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 1 - 10
  • [42] Computing the Interleaving Distance is NP-Hard
    Håvard Bakke Bjerkevik
    Magnus Bakke Botnan
    Michael Kerber
    Foundations of Computational Mathematics, 2020, 20 : 1237 - 1271
  • [43] Dynamic Programming for NP-Hard Problems
    Wang, Xiaodong
    Tian, Jun
    CEIS 2011, 2011, 15
  • [44] Restricted optimal pebbling is NP-hard
    Papp, Laszlo F.
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 258 - 263
  • [45] CHECKING ROBUST NONSINGULARITY IS NP-HARD
    POLJAK, S
    ROHN, J
    MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS, 1993, 6 (01) : 1 - 9
  • [46] RECOGNIZING TOUGH GRAPHS IS NP-HARD
    BAUER, D
    HAKIMI, SL
    SCHMEICHEL, E
    DISCRETE APPLIED MATHEMATICS, 1990, 28 (03) : 191 - 195
  • [47] DETERMINING THE THICKNESS OF GRAPHS IS NP-HARD
    MANSFIELD, A
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1983, 93 (JAN) : 9 - 23
  • [48] The Fault Tolerance of NP-Hard Problems
    Glasser, Christian
    Pavan, A.
    Travers, Stephen
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 374 - +
  • [49] Finding the Best CAFE Is NP-Hard
    Maltais, Elizabeth
    Moura, Lucia
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 356 - 371
  • [50] (2+ε)-SAT IS NP-HARD
    Austrin, Per
    Guruswami, Venkatesan
    Hastad, Johan
    SIAM JOURNAL ON COMPUTING, 2017, 46 (05) : 1554 - 1573
12345