DNA models and algorithms for NP-complete problems

被引：26

作者：

Bach, E ^{[1
]}

Condon, A ^{[1
]}

Glaser, E ^{[1
]}

Tanguay, C ^{[1
]}

机构：

[1] UNIV WISCONSIN,DEPT COMP SCI,MADISON,WI 53706

来源：

关键词：

D O I：

10.1109/CCC.1996.507691

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：290 / 300

页数：11

共 50 条

[31] Neural networks for NP-complete problems
Budinich, M
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1997, 30 (03) : 1617 - 1624
[32] On Some NP-complete SEFE Problems
Angelini, Patrizio
Da Lozzo, Giordano
Neuwirth, Daniel
ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 200 - 212
[33] Generic complexity of NP-complete problems
GROUP-BASED CRYPTOGRAPHY, 2008, : 129 - 134
[34] INFEASIBLE COMPUTATION - NP-COMPLETE PROBLEMS
LAMAGNA, EA
ABACUS-NEW YORK, 1987, 4 (03): : 18 - 33
[35] QUANTUM COMPUTING ALGORITHMS FOR INVERSE PROBLEMS ON GRAPHS AND AN NP-COMPLETE INVERSE PROBLEM
Ilmavirta, Joonas
Lassas, Matti
Lu, Jinpeng
Oksanen, Lauri
Ylinen, Lauri
arXiv, 2023,
[36] OPTP AS THE NORMAL BEHAVIOR OF NP-COMPLETE PROBLEMS
GASARCH, WI
KRENTEL, MW
RAPPOPORT, KJ
MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 487 - 514
[37] ON CHAOTIC BEHAVIOR OF SOME NP-COMPLETE PROBLEMS
PERL, J
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 149 - 161
[38] 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
[39] Solving NP-Complete problems with quantum search
Furer, Martin
LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 784 - 792
[40] NP-COMPLETE DECISION PROBLEMS FOR BINARY QUADRATICS
MANDERS, KL
ADLEMAN, L
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (02) : 168 - 184