Generic complexity of NP-complete problems

被引：0
|
作者：
机构：
来源：
GROUP-BASED CRYPTOGRAPHY | 2008年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：129 / 134
页数：6
相关论文
共 50 条
  • [31] New NP-complete problems associated with lattices
    Hayashi, Shunichi
    Tada, Mitsuru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (05) : 941 - 948
  • [32] Optical solution for bounded NP-complete problems
    Shaked, Natan T.
    Messika, Stephane
    Dolev, Shlorni
    Rosen, Joseph
    APPLIED OPTICS, 2007, 46 (05) : 711 - 724
  • [33] DNA models and algorithms for NP-complete problems
    Univ of Wisconsin, Madison, United States
    J Comput Syst Sci, 2 (172-186):
  • [34] Computing with membranes: Attacking NP-complete problems
    Paun, G
    UNCONVENTIONAL MODELS OF COMPUTATION UMC' 2K, PROCEEDINGS, 2001, : 94 - 115
  • [35] ON INEFFICIENT SPECIAL CASES OF NP-COMPLETE PROBLEMS
    DU, DZ
    BOOK, RV
    THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) : 239 - 252
  • [36] NP-COMPLETE PROBLEMS SIMPLIFIED ON TREE SCHEMAS
    GOODMAN, N
    SHMUELI, O
    ACTA INFORMATICA, 1983, 20 (02) : 171 - 178
  • [37] On the O'Donnell Algorithm for NP-Complete Problems
    da Costa, N. C. A.
    Doria, F. A.
    REVIEW OF BEHAVIORAL ECONOMICS, 2016, 3 (02): : 221 - 242
  • [38] Understanding the Empirical Hardness of NP-Complete Problems
    Leyton-Brown, Kevin
    Hoos, Holger H.
    Hutter, Frank
    Xu, Lin
    COMMUNICATIONS OF THE ACM, 2014, 57 (05) : 98 - 107
  • [39] On NP-complete search problems on finite algebras
    Rossi, Bernardo
    Aichinger, Erhard
    2024 IEEE 54TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, ISMVL 2024, 2024, : 131 - 136
  • [40] On universally easy classes for NP-complete problems
    Demaine, ED
    López-Ortiz, A
    Munro, JI
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 910 - 911
12345