Fifty Years of P vs. NP and the Possibility of the Impossible.

The article discusses the computer science (CS) and mathematical theorem difficulty known as the polynomial (P) vs. nondeterministic polynomial problem (NP) problem, which was first introduced by computer scientists and mathematician Steve Cook in 1971. According to the article, the solution to the...

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 65; no. 1; pp. 76 - 86
Main Author: FORTNOW, LANCE
Format: Article
Published: Association for Computing Machinery Jan2022
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=154455700&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 154455700
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jan2022
      vid: 65
      iid: 1
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        154455700
        10.1145/3460351
      ppf: 76
      ppct: 10
      formats:
      tig:
        atl: Fifty Years of P vs. NP and the Possibility of the Impossible.
      aug:
        au: FORTNOW, LANCE
        affil:
          Professor at Illinois Institute of Technology, Chicago, IL, USA
          Dean of the College of Computing at Illinois Institute of Technology, Chicago, IL, USA
      su:
        Polynomial vs. nondeterministic polynomial problem
        Machine learning
        Artificial intelligence
        Computer science
        Mathematics theorems
      sug:
        subj:
          Polynomial vs. nondeterministic polynomial problem
          Machine learning
          Artificial intelligence
          Computer science
          Mathematics theorems
      ab: The article discusses the computer science (CS) and mathematical theorem difficulty known as the polynomial (P) vs. nondeterministic polynomial problem (NP) problem, which was first introduced by computer scientists and mathematician Steve Cook in 1971. According to the article, the solution to the problem remains elusive. The article examines the relationship between the problem and advances in machine learning (ML), how the problem can be utilized to assess CS possibilities, and the potential of reaching artificial general intelligence.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2022
    holdings:
      @attributes:
        islocal: N