Pages that link to "Item:Q3854623"

The following pages link to Provably Difficult Combinatorial Games (Q3854623):

Displaying 40 items.

• The complexity of synchronous notions of information flow security (Q278742) (← links)
• The guarding game is E-complete (Q389949) (← links)
• Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
• The complexity of pursuit on a graph (Q673639) (← links)
• The complexity of two-player games of incomplete information (Q800838) (← links)
• Deciding inseparability and conservative extensions in the description logic (Q1041590) (← links)
• Solitaire automata (Q1058475) (← links)
• Alternating tree automata (Q1077932) (← links)
• Single-suit two-person card play (Q1093570) (← links)
• Alternating multihead finite automata (Q1116353) (← links)
• Tree-size bounded alternation (Q1145502) (← links)
• The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
• Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
• Theory of annihilation games. I (Q1168901) (← links)
• Complexity of path-forming games (Q1210546) (← links)
• Almost every set in exponential time is P-bi-immune (Q1349712) (← links)
• Complexity of path discovery game problems (Q1566737) (← links)
• Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
• Imperfect information in reactive modules games (Q1641035) (← links)
• Model-checking iterated games (Q1674862) (← links)
• Domino-tiling games (Q1822501) (← links)
• Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
• Weakly complete problems are not rare (Q1918951) (← links)
• Backgammon is hard (Q2150573) (← links)
• QUIXO is EXPTIME-complete (Q2203590) (← links)
• Cops and robbers is EXPTIME-complete (Q2259861) (← links)
• The computational complexity of Angry Birds (Q2302303) (← links)
• From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
• Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
• The complexity of searching implicit graphs (Q2676567) (← links)
• The Complexity of Escaping Labyrinths and Enchanted Forests. (Q3301022) (← links)
• A Temporal Logic of Normative Systems (Q3600564) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• The complexity of searching succinctly represented graphs (Q4645179) (← links)
• Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
• (Q5020996) (← links)
• (Q5136320) (← links)
• (Q5207047) (← links)
• Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
• Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures (Q6152660) (← links)