STACS
2007
Springer
14 years 5 months ago
2007
Springer
STACS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas
STACS
2007
Springer
14 years 5 months ago
2007
Springer
STACS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
STACS
2007
Springer
14 years 5 months ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...