8 citations · 15 across the 14 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.GT2014
DValue for Boolean games is EXP-complete
Egor Ianovski
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a…
cs.FL2014
The existential fragment of S1S over element and successor is the co-Buchi languages
Egor Ianovski
Buchi's theorem, in establishing the equivalence between languages definable in S1S over element and < and the omega-regular languages also demonstrated that S1S over element and <…