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

NP-completeness gave unrelated fields a shared vocabulary

I work in operations research and I can say NP-complete to a biologist or a linguist and be understood. A single classification that spans scheduling, folding and parsing is a real achievement. It is rare for a theoretical idea to travel that far without being diluted.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.