Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    P is the class of problems decidable efficiently. — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→If P = NP, then finding a satisfying valuation for a propositional formula is no harder than constructing its truth table, and factoring a natural number would be no more difficult than verifying a given factorization.

    P is the class of problems decidable efficiently.

    Proof of definition segmentsTruth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Topics

    Truth & KnowledgeProof of definition segments

    Connections

    1 topic

    Modality & Possibility2 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    If P = NP, then finding a satisfying valuation for a propositional formula is no...If P = NP, then the difficulty of deciding and verifying coincide (up to a polyn...NP is the class of problems verifiable efficiently given a certificate.

    Similar

    P is the class of problems decidable efficiently98%P is the class of problems whose membership can be decided efficiently89%The complexity class P describes the class of feasibly decidable probl...89%If P = NP, every problem in NP is also in P and thus efficiently decid...87%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    1 On the significance of \(\textbf{P} \neq \textbf{NP}\)? The appreciation of complexity theory outside of theoretical computer science is largely due to the notoriety of open questions such as 1–4. \) – has attracted the greatest attention. e. the Millennium Problems (Cook 2006). g. (Sipser 1992), (Fortnow 2009), and (Fortnow 2013). \) will prove to have far reaching practical and theoretical consequences outside of computer science. Perhaps the most significant of these revolves around the pos

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective