16666 search results - page 236 / 3334 » Descriptive and Computational Complexity |
166
click to vote
FOCS
2005
IEEE
16 years 24 days 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...
203
click to vote
SAC
2005
ACM
16 years 22 days ago
2005
ACM
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
191
click to vote
ACMSE
2006
ACM
15 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...
212
click to vote
EUROCRYPT
2004
Springer
16 years 17 days 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...