共 46 条
[1]
The maximum common subgraph problem: Faster solutions via vertex cover
[J].
2007 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2,
2007,
:367-+
[2]
Searching for quantum speedup in quasistatic quantum annealers
[J].
PHYSICAL REVIEW A,
2015, 92 (05)
[3]
[Anonymous], 2013, HDB COMBINATORIAL OP
[4]
[Anonymous], 2014, arXiv
[5]
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[7]
Baum D., 2007, THESIS
[8]
Bian Z., 2016, ARXIV160303111
[10]
Boixo S, 2014, NAT PHYS, V10, P218, DOI [10.1038/nphys2900, 10.1038/NPHYS2900]