2168 search results - page 136 / 434 » Randomized Algorithms and Complexity Theory |
111
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
131
Voted
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
150
click to vote
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
143
click to vote
JOC
2000
15 years 3 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
114
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...