3328 search results - page 129 / 666 » Topological Quantum Computation |
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
IMA
2001
Springer
14 years 2 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...
CORR
2010
Springer
13 years 10 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...
CORR
2007
Springer
13 years 10 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...
JCC
2008
13 years 10 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...