Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem

被引：19
|
作者：
Choi, Vicky [1 ]
机构：
[1] Virginia Polytech Inst & State Univ, Dept Comp Sci, Falls Church, VA 22043 USA
来源：
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 2011年 / 108卷 / 07期
关键词：
D O I：
10.1073/pnas.1018310108
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
引用
收藏
页码：E19 / E20
页数：2
相关论文
共 50 条
  • [21] SOFTWARE CONFIGURATION AN NP-COMPLETE PROBLEM
    CALABOUGH, J
    DATA BASE, 1988, 19 (02): : 29 - 34
  • [22] THE VIA MINIMIZATION PROBLEM IS NP-COMPLETE
    NACLERIO, NJ
    MASUDA, S
    NAKAJIMA, K
    IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) : 1604 - 1608
  • [23] Computing quantum discord is NP-complete
    Huang, Yichen
    NEW JOURNAL OF PHYSICS, 2014, 16
  • [24] Attaining success is an NP-complete problem
    Hemmady, S
    COMPUTER, 1996, 29 (11) : 136 - 136
  • [25] THE GRAPH GENUS PROBLEM IS NP-COMPLETE
    THOMASSEN, C
    JOURNAL OF ALGORITHMS, 1989, 10 (04) : 568 - 576
  • [26] The Cophylogeny Reconstruction Problem Is NP-Complete
    Ovadia, Y.
    Fielder, D.
    Conow, C.
    Libeskind-Hadas, R.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (01) : 59 - 65
  • [27] 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
  • [28] DNA models and algorithms for NP-complete problems
    Univ of Wisconsin, Madison, United States
    J Comput Syst Sci, 2 (172-186):
  • [29] 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
  • [30] MULTIPROCESSOR SOLUTION IN OCCAM TO AN NP-COMPLETE PROBLEM
    HEAL, B
    MICROPROCESSORS AND MICROSYSTEMS, 1985, 9 (04) : 162 - 170
12345