1414 search results - page 48 / 283 » Randomness and Universal Machines |
135
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
130
click to vote
ACSAC
2003
IEEE
15 years 8 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
114
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
138
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
119
Voted
ECCC
2010
15 years 3 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...