| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Probability... | ||||||
| Re:Fundimental calculus detail | ||||||
| Re:Probability... | ||||||
| attached to The Big Bang Generator That Wasn't | ||||||
| Re:Some Points to Consider | ||||||
| Some Points to Consider | ||||||
| attached to The Programmer's Stone | ||||||
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
