128
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
STACS
2009
Springer
15 years 10 months ago
2009
Springer
149
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
STACS
2009
Springer
15 years 10 months ago
2009
Springer
105
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
127
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
117
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
106
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
141
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...