A Stochastic Limit Approach to the SAT Problem

Springer Science and Business Media LLC - 2004
Luigi Accardi1, Masanori Ohya2
1Centro V. Volterra, Università di Roma Torvergata, Via Orazio Raimondo, 00173 Roma, Italia
2Department of Information Sciences, Tokyo University of Science, Noda City, Chiba 278–8510, Japan

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

10.1007/978-3-662-04929-7

10.1007/s002459900097

10.1103/PhysRevLett.81.3992

Czachor M., Acta Phys. Slov., 48, 157

10.1023/A:1009651417615

Ohya M., 1998, Mathematical Foundation of Quantum Computer

10.1016/S0034-4877(03)90002-4

Garey M., 1979, Computers and Intractability — a guide to the theory of NP-completeness

10.1023/A:1026620313483

10.1098/rspa.1985.0070

10.1103/RevModPhys.68.733

10.1023/A:1025123923519

Fagnola F., J. Math. Phys.

Thông tin
Thông tin xuất bản

Springer Science and Business Media LLC

Thông tin tác giả