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 条
  • [21] RIGID FOLDABILITY IS NP-HARD
    Akitaya, Hugo A.
    Demaine, Erik D.
    Horiyama, Takashi
    Hull, Thomas C.
    Ku, Jason S.
    Tachi, Tomohiro
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2020, 11 (01) : 93 - 124
  • [22] HANANO Puzzle is NP-hard
    Liu, Ziwen
    Yang, Chao
    INFORMATION PROCESSING LETTERS, 2019, 145 : 6 - 10
  • [23] Approximating the spectral radius of sets of matrices in the max-algebra is NP-Hard
    Blondel, VD
    Gaubert, S
    Tsitsiklis, JN
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2000, 45 (09) : 1762 - 1765
  • [24] Counting the Solutions of a System of Equations over Finite Field is NP-Hard
    Lin, Hong
    QUANTITATIVE LOGIC AND SOFT COMPUTING 2010, VOL 2, 2010, 82 : 755 - 759
  • [25] Pool resolution is NP-hard to recognize
    Buss, Samuel R.
    ARCHIVE FOR MATHEMATICAL LOGIC, 2009, 48 (08) : 793 - 798
  • [26] Optimization of lattice surgery is NP-hard
    Herr, Daniel
    Nori, Franco
    Devitt, Simon J.
    NPJ QUANTUM INFORMATION, 2017, 3
  • [27] DECOMPOSITION OF ARITHMETICAL NP-HARD PROBLEMS
    MEJZLIK, P
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 31 - 38
  • [28] Computing the norm ||A||∞,1 is NP-hard
    Rohn, J
    LINEAR & MULTILINEAR ALGEBRA, 2000, 47 (03): : 195 - 204
  • [29] Diagonal matrix scaling is NP-hard
    Khachiyan, L
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1996, 234 : 173 - 179
  • [30] Most Tensor Problems Are NP-Hard
    Hillar, Christopher J.
    Lim, Lek-Heng
    JOURNAL OF THE ACM, 2013, 60 (06)
12345