13621 search results - page 91 / 2725 » Computability and Complexity in Self-assembly |
69
Voted
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
FOCS
2005
IEEE
15 years 6 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...
109
click to vote
ACMSE
2006
ACM
15 years 4 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...
117
Voted
EUROCRYPT
2004
Springer
15 years 6 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
15 years 26 days 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...