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
    The argument conflates syntactic polynomial-time construc... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→3-SAT can be reduced to INDEPENDENT SET in polynomial time

    The argument conflates syntactic polynomial-time constructibility of G_φ with a semantic guarantee that the graph faithfully encodes all and only satisfying assignments.

    ?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.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    3-SAT can be reduced to INDEPENDENT SET in polynomial time

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.

    Details

    Type
    claim
    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