Generic complexity of NP-complete problems

被引：0
|
作者：
机构：
来源：
GROUP-BASED CRYPTOGRAPHY | 2008年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：129 / 134
页数：6
相关论文
共 50 条
  • [41] Atom cavity encoding for NP-complete problems
    Meng Ye
    Xiaopeng Li
    Quantum Frontiers, 3 (1):
  • [42] A FAMILY OF NP-COMPLETE DATA AGGREGATION PROBLEMS
    HELMAN, P
    ACTA INFORMATICA, 1989, 26 (05) : 485 - 499
  • [43] Monadic logical definability of NP-complete problems
    Grandjean, E
    Olive, F
    COMPUTER SCIENCE LOGIC, 1995, 933 : 190 - 204
  • [44] NODE-DELETION NP-COMPLETE PROBLEMS
    KRISHNAMOORTHY, MS
    DEO, N
    SIAM JOURNAL ON COMPUTING, 1979, 8 (04) : 619 - 625
  • [45] MARTINGALE INEQUALITIES, INTERPOLATION AND NP-COMPLETE PROBLEMS
    RHEE, WT
    TALAGRAND, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1989, 14 (01) : 91 - 96
  • [46] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1996, : 290 - 300
  • [47] Exponential complexity of an adiabatic algorithm for an NP-complete problem
    Znidaric, M
    Horvat, M
    PHYSICAL REVIEW A, 2006, 73 (02):
  • [48] On universally easy classes for NP-complete problems
    Demaine, ED
    López-Ortiz, A
    Munro, JI
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 471 - 476
  • [49] SUPERCOMPUTING FOR SOLVING A CLASS OF NP-COMPLETE AND ISOMORPHIC COMPLETE PROBLEMS
    KAPRALSKI, A
    COMPUTING SYSTEMS, 1992, 7 (04): : 218 - 228
  • [50] Automatically Solving NP-Complete Problems on a Quantum Computer
    Hu, Shaohan
    Liu, Peng
    Chen, Chun-Fu
    Pistoia, Marco
    PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING - COMPANION (ICSE-COMPANION, 2018, : 258 - 259
12345