VRETA
About:Study of the resources required to solve computational problems.
Problem

Worst case analysis told me nothing useful about my instances

I work with satisfiability instances that come out of a compiler, and they are solved in seconds despite the problem being NP-complete. The theory I was taught has no vocabulary for the structure that makes my instances easy. I understand why worst case is the clean thing to prove, but the gap between that and practice is left as an aside.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.