| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:But when can I have a.... | ||||||
| attached to Guide To Designing Low Power Handhelds | ||||||
| Re:Standards | ||||||
| attached to Wall Street Journal: Mac vs. PC | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Re:But when can I have a.... | ||||||
| attached to Guide To Designing Low Power Handhelds | ||||||
| Re:Standards | ||||||
| attached to Wall Street Journal: Mac vs. PC | ||||||
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