| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| What would PKD Do? | ||||||
| attached to Please No, Not a Blade Runner Sequel | ||||||
| Shades of Vinge's Localizers? | ||||||
| attached to TCP/IP Meets Physical Reality | ||||||
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -- Bart Miller
