Sciweavers

61 search results - page 13 / 13
» On obtaining the Boyer-Moore string-matching algorithm by pa...
Sort
View
JCSS
2008
120views more  JCSS 2008»
13 years 7 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson