13621 search results - page 116 / 2725 » Computability and Complexity in Self-assembly |
LOGCOM
2007
13 years 10 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...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
EUROCRYPT
1999
Springer
14 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...
STOC
1996
ACM
14 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
14 years 2 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...