On the cell probe complexity of polynomial evaluation

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

• Lower bounds for Union-Split-FIND related problems on rendom access machines
  ανά: Miltersen Bro, Peter
• Relative to a random oracle, NP is not small
  ανά: Kautz, S. M., κ.ά.
• Surface reconstruction between simple polygons via angle criteria B 94-11, April 1994
  ανά: Welzl, Emo, κ.ά.
• Fast greedy triangulation algorithms B 94-09 April 1994
  ανά: Dickerson, Matthew T., κ.ά.
• PI mass production and an optimal circuit for the nechiporuk slice
  ανά: Hiltgen, Alain P., κ.ά.