13603 search results - page 165 / 2721 » On the Complexity of Computing Treelength |
126
click to vote
JC
2006
15 years 4 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
137
click to vote
WABI
2001
Springer
15 years 8 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...
127
click to vote
LOGCOM
2007
15 years 4 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...
113
click to vote
CP
2005
Springer
15 years 9 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...
132
click to vote
EUROCRYPT
1999
Springer
15 years 8 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...