2924 search results - page 195 / 585 » Lower Bounds in Distributed Computing |
127
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
144
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
118
click to vote
CC
2007
Springer
15 years 3 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
102
Voted
SLIP
2009
ACM
15 years 9 months ago
2009
ACM
One of the popular design methodologies for power distribution networks (PDNs) is to identify a target impedance to be met across a broad frequency range. The methodology is based...
112
click to vote
CONCURRENCY
2002
15 years 3 months ago
2002
We present the results of a detailed study of the Virtual Interface (VI) paradigm as a communication foundation for a distributed computing environment. Using Active Messages and ...