| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Let's not forget... | ||||||
| The Java License is better than you think... | ||||||
| attached to Interview with L. Peter Deutsch of Ghostscript | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Let's not forget... | ||||||
| The Java License is better than you think... | ||||||
| attached to Interview with L. Peter Deutsch of Ghostscript | ||||||
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