Lower bounds for Union-Split-FIND related problems on rendom access machines
| Main Author: | Miltersen Bro, Peter (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Series: | Research Report
258 |
| Subjects: |
Similar Items
-
Relative to a random oracle, NP is not small
by: Kautz, S. M., et al. -
On the cell probe complexity of polynomial evaluation
by: Miltersen Bro, Peter -
Upper bounds for the expected length of a longest common subsequence of two binary sequences
by: Dancik, V., et al. -
Consistency of natural relations on sets
by: Koizumi, H., et al. -
Surface reconstruction between simple polygons via angle criteria B 94-11, April 1994
by: Welzl, Emo, et al.