Back to Results
First PageMeta Content
Computational complexity theory / Analysis of algorithms / Theory of computation / Mathematics / Edsger W. Dijkstra / Algorithm / Mathematical logic / Theoretical computer science / Time complexity / Shortest path problem / Asymptotically optimal algorithm / Randomized algorithm


Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch
Add to Reading List

Document Date: 2015-05-29 10:12:12

Open Document

File Size: 330,43 KB

Share Result on Facebook
UPDATE