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
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Original/inverse
    See Original
    Inverse View

    It is not the case that The existence of a polynomial time algorithm for any NP-complete problem would imply P = NP, which runs strongly counter to expectation

    ?Set your confidence on the premises below to see your aggregate.

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

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.