STACS
2016
Springer
8 years 8 months ago
2016
Springer
Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over strings. We study structural propert...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
STACS
2016
Springer
8 years 8 months ago
2016
Springer
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even ho...
100
click to vote
STACS
2016
Springer
8 years 8 months ago
2016
Springer
Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an expon...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of [22] applies also...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
We prove that for every positive integer r and for every graph class G of bounded expansion, the r-Dominating Set problem admits a linear kernel on graphs from G. Moreover, in the...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
STACS
2016
Springer
8 years 8 months ago
2016
Springer
The quantitative verification of Probabilistic Automata (PA) is undecidable in general. Unary PA are a simpler model where the choice of action is fixed. Still, the quantitative...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution D over [n] and a proper...
STACS
2016
Springer
8 years 8 months ago
2016
Springer
John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of 0−1-strings. Later, Grygiel and Lescanne conjectured that the number...