13603 search results - page 175 / 2721 » On the Complexity of Computing Treelength |
118
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
123
click to vote
CSCWD
2001
Springer
15 years 9 months ago
2001
Springer
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
128
click to vote
FSTTCS
1994
Springer
15 years 8 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
134
click to vote
AML
2007
15 years 4 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...