13603 search results - page 281 / 2721 » On the Computational Complexity of Cut-Reduction |
157
click to vote
FOCS
2005
IEEE
16 years 13 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...
204
click to vote
EUROCRYPT
2004
Springer
16 years 6 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...
182
click to vote
AAMAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Agent-based computing is a promising approach for developing applications in complex domains. However, despite the great deal of research in the area, a number of challen...
184
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...