13603 search results - page 139 / 2721 » On the Complexity of Computing Treelength |
COMPLEX
2009
Springer
14 years 4 months ago
2009
Springer
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
ACMSE
2006
ACM
14 years 1 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...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
CACM
2006
13 years 9 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...