A Stochastic Limit Approach to the SAT Problem

  • Authors:
  • Luigi Accardi;Masanori Ohya

  • Affiliations:
  • Centro V. Volterra, Università di Roma Torvergata, Via Orazio Raimondo, 00173 Roma, Italia, e-mail: accardi@volterra.mat.uniroma2.it;Department of Information Sciences, Tokyo University of Science, Noda City, Chiba 278-8510, Japan, e-mail: ohya@is.noda.tus.ac.jp

  • Venue:
  • Open Systems & Information Dynamics
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.