2168 search results - page 32 / 434 » Randomized Algorithms and Complexity Theory |
LATIN
1998
Springer
15 years 3 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
109
click to vote
SAGA
2007
Springer
15 years 5 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
NIPS
2003
15 years 1 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...