17541 search results - page 425 / 3509 » Complexity in scalable computing |
155
click to vote
FSTTCS
2009
Springer
16 years 18 days ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
160
click to vote
ENDM
2006
15 years 6 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...
129
click to vote
GC
2002
Springer
15 years 5 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
144
click to vote
CSR
2007
Springer
16 years 6 days 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...
208
click to vote
DIGRA
2005
Springer
15 years 11 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 ...