Relative to a random oracle, NP is not small
| Main Authors: | Kautz, S. M. (Author), Miltersen Bro, P. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Series: | Research Report
263 |
| Subjects: |
Similar Items
-
Lower bounds for Union-Split-FIND related problems on rendom access machines
by: Miltersen Bro, Peter -
On the cell probe complexity of polynomial evaluation
by: Miltersen Bro, Peter -
Consistency of natural relations on sets
by: Koizumi, H., et al. -
Upper bounds for the expected length of a longest common subsequence of two binary sequences
by: Dancik, V., et al. -
PI mass production and an optimal circuit for the nechiporuk slice
by: Hiltgen, Alain P., et al.