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
    Worst-case complexity correctly predicts that no algorith... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Many NP-complete problems are routinely solved in practice via SAT solvers and heuristics, meaning worst-case intractability fails to track the actual boundary of feasible computation.

    Worst-case complexity correctly predicts that no algorithm solves all NP-complete instances efficiently; success on curated/structured instances doesn't contradict this.

    ?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

    1 linked claim

    Many NP-complete problems are routinely solved in practice via SAT solvers and h...

    Related

    Many NP-complete problems are routinely solved in practice via SAT solvers and h...

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.

    Open for perspectives

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

    Share the first perspective