2996 search results - page 186 / 600 » Numberings and Randomness |
150
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
139
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
178
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper adresses the behaviour of the mutual information of correlated MIMO Rayleigh channels when the numbers of transmit and receive antennas converge to + at the same rate. ...
165
click to vote
TIT
2008
15 years 6 months ago
2008
Abstract--This paper adresses the behavior of the mutual information of correlated multiple-input multiple-output (MIMO) Rayleigh channels when the numbers of transmit and receive ...
139
click to vote
IPL
2000
15 years 6 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...