13603 search results - page 169 / 2721 » On the Complexity of Computing Treelength |
138
click to vote
ENDM
2006
15 years 4 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
118
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
172
click to vote
DIGRA
2005
Springer
15 years 10 months ago
2005
Springer
Do computer simulation games display emergent behavior? Are they models of complex systems or ‘life’ systems? This paper aims to explore and investigate how games studies can ...
132
click to vote
AAAI
1990
15 years 5 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
124
click to vote
EOR
2008
15 years 4 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...