13603 search results - page 60 / 2721 » On the Computational Complexity of Cut-Reduction |
LOGCOM
2007
14 years 9 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
119
click to vote
STOC
1996
ACM
15 years 2 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
ISSAC
1994
Springer
15 years 1 months ago
1994
Springer
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
NIPS
2003
14 years 11 months ago
2003
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....