There's a rare, related activity which I think of as field finding. It's not about problem finding, per se, but rather about developing an underlying narrative which generates many superb problems over decades or centuries.
-
-
I'm not entirely sure myself: maybe
@fortnow and@rrwilliams know better -
While problems like TSP and 3-coloring were in the wild, Cook first defined NP-completeness and P v NP and Karp showed it applied to well-studied combinatorial problems. Levin's paper played less of a role since it didn't make it to the states until a few years later.
- 4 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.