'Minimal depth' presentation slideshows

571 views • 35 slides

P and NP

P and NP. Computational Complexity. Recall from our sorting examples at the start of class that we could prove that any sort would have to do at least some minimal amount of work (lower bound) We proved this using decision trees (ch 7.8) (the following decision tree slides are repeated).

596 views • 34 slides

Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave

271 views • 18 slides