534 search results - page 2 / 107 » Power from Random Strings |
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
COCO
2010
Springer
13 years 9 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
AAAI
2007
13 years 7 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
FSE
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...