Quantization of Random Walks: Search Algorithms and Hitting Time


Extended abstract Many classical search problems can be cast in the following abstract framework: Given a finite set X and a subset M ⊆ X of marked elements, detect if M is empty or not, or find an element in M if there is any. When M is not empty, a naive approach to the finding problem is to repeatedly pick a uniformly random element of X until a marked… (More)
DOI: 10.1007/978-3-642-13182-0_33


  • Presentations referencing similar topics