1236 search results - page 3 / 248 » Prefix-Like Complexities and Computability in the Limit |
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
ACMSE
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
HICSS
2003
IEEE
14 years 20 days ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
ICALP
2009
Springer
14 years 7 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...
BROADNETS
2006
IEEE
14 years 1 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...