Generic complexity of NP-complete problems

被引：0
|
作者：
机构：
来源：
GROUP-BASED CRYPTOGRAPHY | 2008年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：129 / 134
页数：6
相关论文
共 50 条
  • [21] On Some NP-complete SEFE Problems
    Angelini, Patrizio
    Da Lozzo, Giordano
    Neuwirth, Daniel
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 200 - 212
  • [22] INFEASIBLE COMPUTATION - NP-COMPLETE PROBLEMS
    LAMAGNA, EA
    ABACUS-NEW YORK, 1987, 4 (03): : 18 - 33
  • [23] OPTP AS THE NORMAL BEHAVIOR OF NP-COMPLETE PROBLEMS
    GASARCH, WI
    KRENTEL, MW
    RAPPOPORT, KJ
    MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 487 - 514
  • [24] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 172 - 186
  • [25] ON CHAOTIC BEHAVIOR OF SOME NP-COMPLETE PROBLEMS
    PERL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 149 - 161
  • [26] SAT Oracles, for NP-Complete Problems and Beyond
    Le Berre, Daniel
    SPLC'19: PROCEEDINGS OF THE 23RD INTERNATIONAL SYSTEMS AND SOFTWARE PRODUCT LINE CONFERENCE, VOL A, 2020, : XXII - XXII
  • [27] Solving NP-Complete problems with quantum search
    Furer, Martin
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 784 - 792
  • [28] NP-COMPLETE DECISION PROBLEMS FOR BINARY QUADRATICS
    MANDERS, KL
    ADLEMAN, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (02) : 168 - 184
  • [29] Quantum advantage in deciding NP-complete problems
    Nagy, Marius
    Nagy, Naya
    QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
  • [30] Quantum advantage in deciding NP-complete problems
    Marius Nagy
    Naya Nagy
    Quantum Information Processing, 22
12345