Skip to main content
SpringerLink
Log in

A Stochastic Limit Approach to the SAT Problem

  • Published:
Open Systems & Information Dynamics

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centro V. Volterra, Università di Roma Torvergata, Via Orazio Raimondo, 00173, Roma, Italia

    Luigi Accardi

  2. Department of Information Sciences, Tokyo University of Science, Noda City, Chiba, 278-8510, Japan

    Masanori Ohya

Authors
  1. Luigi Accardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masanori Ohya
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Accardi, L., Ohya, M. A Stochastic Limit Approach to the SAT Problem. Open Systems & Information Dynamics 11, 219–233 (2004). https://doi.org/10.1023/B:OPSY.0000047567.88377.74

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:OPSY.0000047567.88377.74

Keywords

Search

Navigation