| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| First?? | ||||||
| attached to First Graphene Transistor | ||||||
| What defines a "Client"? | ||||||
| attached to To Media Companies, BitTorrent Implies Guilt | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| First?? | ||||||
| attached to First Graphene Transistor | ||||||
| What defines a "Client"? | ||||||
| attached to To Media Companies, BitTorrent Implies Guilt | ||||||
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