135
click to vote
STACS
2016
Springer
10 years 17 days ago
2016
Springer
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic second-order logic. In this fragment we only allow formulae of the form ∃t...
137
click to vote
STACS
2016
Springer
10 years 17 days ago
2016
Springer
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a...
151
click to vote
STACS
2016
Springer
10 years 17 days ago
2016
Springer
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles...
122
click to vote
STACS
2016
Springer
10 years 17 days ago
2016
Springer
We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth ...
129
Voted
STACS
2016
Springer
10 years 17 days ago
2016
Springer
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this ...