1391 search results - page 29 / 279 » Complexity Limitations on Quantum Computation |
159
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
139
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
121
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
114
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
2006
IEEE
— As an optical signal propagates along a lightpath to its destination in wavelength-routed optical networks (WRONs), the quality of service (QoS) will be degraded by transmissio...
107
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...