13603 search results - page 1 / 2721 » On the Complexity of Computing Treelength |
102
Voted
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
156
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
119
Voted
JCSS
2011
14 years 8 months ago
2011
115
Voted
ENTCS
2011
14 years 8 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
PAAPP
2007
15 years 1 months ago
2007
