| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| BPL, HAMS, and First Amendment rights | ||||||
| attached to Hams Complain about Powerline Broadband | ||||||
| Federal funding threat to universities? | ||||||
| attached to Federal Cyberspace Policy Draft Released | ||||||
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
