Sciweavers

152 search results - page 31 / 31
» Constructive Proofs of Concentration Bounds
Sort
View
EJC
2007
13 years 6 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck