| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Yay competition! | ||||||
| Re:shouldn't be a problem | ||||||
| attached to Intel Undercuts AMD | ||||||
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
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:Yay competition! | ||||||
| Re:shouldn't be a problem | ||||||
| attached to Intel Undercuts AMD | ||||||
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