215 search results - page 37 / 43 » Quantum computers that can be simulated classically in polyn... |
CC
2007
Springer
13 years 7 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 ...
CGF
2010
13 years 6 months ago
2010
In this paper we present an extended critical point concept which allows us to apply vector field topology in the case of unsteady flow. We propose a measure for unsteadiness wh...
CIMAGING
2010
13 years 9 months ago
2010
Undersea localization requires a computationally expensive partial differential equation simulation to test each candidate hypothesis location via matched filter. We propose a met...
MOBIHOC
2009
ACM
14 years 2 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...