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.
Accardi, L., Ohya, M. (2004). A Stochastic limit approach to the SAT problem. OPEN SYSTEMS & INFORMATION DYNAMICS, 11(3), 219-233 [10.1023/B:OPSY.0000047567.88377.74].
A Stochastic limit approach to the SAT problem
ACCARDI, LUIGI;
2004-09-01
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
A Stochastic Limit Approach to the SAT Problem.pdf
accesso aperto
Dimensione
218.71 kB
Formato
Adobe PDF
|
218.71 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
