I have read the response of Richard Karp to the P vs NP problem (The P=?NP Poll by William I. Gasarch):
"My
hunch is that the problem will be solved by a young researcher who is
not encumbered by too much conventional wisdom about how to attack the
problem."
Reachability in Acyclic Safe Nets proposes a solution.
