7486 search results - page 160 / 1498 » The Limits of Quantum Computers |
162
Voted
CIE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
186
Voted
ML
2000
ACM
15 years 5 months ago
2000
ACM
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
152
click to vote
HPCN
1994
Springer
15 years 10 months ago
1994
Springer
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...
141
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
138
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...