13603 search results - page 277 / 2721 » On the Complexity of Computing Treelength |
158
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
176
click to vote
FCS
2009
15 years 3 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
185
click to vote
CIE
2007
Springer
16 years 6 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
170
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
155
click to vote
FOCS
2007
IEEE
16 years 11 days ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...