13603 search results - page 146 / 2721 » On the Complexity of Computing Treelength |
RECOMB
2007
Springer
14 years 10 months ago
2007
Springer
FOCS
1994
IEEE
14 years 1 months ago
1994
IEEE
This paper concerns the open problem of Lov
ICPP
1994
IEEE
14 years 1 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
APAL
2010
13 years 9 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
CVPR
2001
IEEE
14 years 11 months ago
2001
IEEE