A Stochastic limit approach to the SAT problem

被引：11

作者：

Accardi, L

Ohya, M

机构：

[1] Univ Roma Tor Vergata, Ctr V Volterra, I-00173 Rome, Italy

[2] Sci Univ Tokyo, Dept Informat Sci, Noda, Chiba 2788510, Japan

来源：

OPEN SYSTEMS & INFORMATION DYNAMICS | 2004年 / 11卷 / 03期

关键词：

D O I：

10.1023/B:OPSY.0000047567.88377.74

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

There exists an important problem whether there exists an algorithm to solve an NP-complete problem in polynomial time. In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above.

引用

页码：219 / 233

页数：15

共 27 条

[1] Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems [J].

Abrams, DS ;

Lloyd, S .

PHYSICAL REVIEW LETTERS, 1998, 81 (18) :3992-3995

[2] Compound channels, transition expectations, and liftings [J].

Accardi, L ;

Ohya, M .

APPLIED MATHEMATICS AND OPTIMIZATION, 1999, 39 (01) :33-59

[3]

ACCARDI L, 2001, P INT C UNC MOD COMP

[4]

ACCARDI L, 2003, QUANTUM THEORY ITS S

[5]

ACCARDI L, UNPUB STOCHASTIC LIM

[6]

ACCARDI L, GEN QUANTUM TURING M

[7]

ACCARDI L, 2000, P INT C UNC MOD COMP

[8]

ACCARDI L, 2001, GEN GROVERS ALGORITH

[9]

ACCARDI L, 542 VOLT CTR

[10]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

← 1 2 3 →