19320 search results - page 260 / 3864 » On the complexity of computing determinants |
174
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
160
click to vote
LOGCOM
2007
15 years 6 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...
150
click to vote
CP
2005
Springer
16 years 5 days 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...
158
click to vote
EUROCRYPT
1999
Springer
15 years 11 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...
218
click to vote
STOC
1996
ACM
15 years 10 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...