2168 search results - page 19 / 434 » Randomized Algorithms and Complexity Theory |
STOC
1992
ACM
15 years 3 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
STOC
2005
ACM
15 years 5 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
118
click to vote
TNN
2010
14 years 6 months ago
2010
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
ALT
2008
Springer
15 years 8 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
125
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...