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 条
  • [31] Optimal state amalgamation is NP-hard
    Frongillo, Rafael M.
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2019, 39 : 1857 - 1869
  • [32] The "Art of Trellis Decoding" is NP-Hard
    Kashyap, Navin
    APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, PROCEEDINGS, 2007, 4851 : 198 - +
  • [33] Wasserstein Barycenters Are NP-Hard to Compute
    Altschuler, Jason M.
    Boix-Adsera, Enric
    SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2022, 4 (01): : 179 - 203
  • [34] Automating Cutting Planes Is NP-Hard
    Goos, Mika
    Koroth, Sajin
    Mertz, Ian
    Pitassi, Toniann
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 68 - 77
  • [35] Alignment and distribution is NOT (always) NP-hard
    Boudet, V
    Rastello, F
    Robert, Y
    1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1998, : 648 - 657
  • [36] Self-concordance is NP-hard
    Lim, Lek-Heng
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 68 (02) : 357 - 366
  • [37] The string barcoding problem is NP-hard
    Dalpasso, M
    Lancia, G
    Rizzi, R
    COMPARATIVE GENOMICS, 2005, 3678 : 88 - 96
  • [38] The Tandem Duplication Distance Is NP-Hard
    Lafond, Manuel
    Zhu, Binhai
    Zou, Peng
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [39] POLYNOMIAL BOUNDING FOR NP-HARD PROBLEMS
    CAMERINI, PM
    MAFFIOLI, F
    MATHEMATICAL PROGRAMMING STUDY, 1980, 12 (APR): : 115 - 119
  • [40] Link crossing number is NP-hard
    de Mesmay, Arnaud
    Schaefer, Marcus
    Sedgwick, Eric
    JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, 2020, 29 (06)
12345