Scribd Logo
Upload

Welcome to Scribd!

  • PNP 12 PT

    Uploaded by

    angelica_lim
    212K views102 pages
    This document presents a proof that P ≠ NP, the complexity classes of problems that can be solved in polynomial time by a deterministic Turing machine and non-deterministic polynomial time, respectively, are separate. It does this by showing that polynomial time algorithms, which can be described by fixed point logic, cannot solve NP-complete problems like k-SAT in their computationally hard phases as characterized by statistical physics. Specifically, it constructs a graphical model to represent the information flows of fixed point logic computations on random k-SAT instances, and uses properties of these instances to show the model cannot generate solutions with the extensive long-range correlations seen in hard phases, implying P ≠ NP.

    Original Description:

    (Source: HP Research Labs) Longstanding math problem is solved (August 2010)

    Original Title

    pnp12pt

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    212K views102 pages

    PNP 12 PT

    Uploaded by

    angelica_lim
    This document presents a proof that P ≠ NP, the complexity classes of problems that can be solved in polynomial time by a deterministic Turing machine and non-deterministic polynomial time, …
    Full description
    of 102

    Reward Your Curiosity

    Everything you want to read.
    Anytime. Anywhere. Any device.
    No Commitment. Cancel anytime.
    576648e32a3d8b82ca71961b7a986505