1209 search results - page 161 / 242 » Universal Algebra and Computer Science |
119
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
136
Voted
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
129
click to vote
VL
2006
IEEE
15 years 8 months ago
2006
IEEE
Now that we have end-user programming environments capable of empowering kids with no programming background to build games in a matter of hours, a new quest for raising the ceili...
112
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
GI
2005
Springer
15 years 8 months ago
2005
Springer
d Abstract) Stefan Lucks1 , Erik Zenner2 , Andr´e Weimerskirch3 , Dirk Westhoff4 1 Theoretische Informatik, University of Mannheim, Germany 2 Erik Zenner, Cryptico A/S, Copenhagen...