6 search results - page 1 / 2 » Easier Ways to Win Logical Games |
131
Voted
DIMACS
1996
15 years 7 days ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
191
click to vote
LCC
1994
15 years 3 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
67
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
104
click to vote
COCO
2008
Springer
15 years 21 days ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
92
Voted
LPAR
2004
Springer
15 years 4 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...