11547 search results - page 127 / 2310 » Quantum computing and communication |
IMA
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
137
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
105
click to vote
JCC
2008
15 years 4 months ago
2008
: In accounting for the magnetic properties of discrete and extended compounds with unpaired spins, it is crucial to know the nature of their ground and low-lying excited states. I...
250
click to vote
PC
2007
15 years 4 months ago
2007
This paper presents the implementation of MPICH2 over the Nemesis communication subsystem and the evaluation of its shared-memory performance. We describe design issues as well as...