Lower bounds for Union-Split-FIND related problems on rendom access machines

Παρόμοια τεκμήρια

• Relative to a random oracle, NP is not small
  ανά: Kautz, S. M., κ.ά.
• On the cell probe complexity of polynomial evaluation
  ανά: Miltersen Bro, Peter
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
  ανά: Dancik, V., κ.ά.
• Consistency of natural relations on sets
  ανά: Koizumi, H., κ.ά.
• Surface reconstruction between simple polygons via angle criteria B 94-11, April 1994
  ανά: Welzl, Emo, κ.ά.