The computational feat reported in Adleman's seminal article was innocuous enough: examine a graph of seven nodes, and determine whether a one-way path exists that connects all the nodes once and only ...