137
click to vote
STACS
2016
Springer
10 years 17 days 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...
148
click to vote
STACS
2016
Springer
10 years 17 days 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...
279
click to vote
STACS
2016
Springer
10 years 17 days 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...
141
click to vote
STACS
2016
Springer
10 years 17 days 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...