224
Voted
STACS
9 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...
93
Voted
STACS
9 years 8 months 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...
96
Voted
STACS
9 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...
95
Voted
STACS
9 years 8 months 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...
91
Voted
STACS
9 years 8 months ago
2016 Springer  |
Theoretical Computer Science