1552 search results - page 95 / 311 » On the Complexity of Constant Propagation |
164
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
179
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
148
click to vote
OPODIS
2004
15 years 7 months ago
2004
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algo...
158
click to vote
NN
1998
Springer
15 years 6 months ago
1998
Springer
In lamprey, the supraspinal control of velocity is mainly accomplished by the reticulospinal (RS) system. During locomotion, RS neurones are rhythmically active with a cycle durat...
150
click to vote
CIE
2009
Springer
16 years 29 days ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...