Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057): Difference between revisions

@@ Property / cites work @@
+Polynomial-Time Under-Approximation of Winning Regions in Parity Games
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, logics, and infinite games. A guide to current research
+Normal rank
@@ Property / cites work @@
+Algorithms for Parity Games
@@ Property / cites work: Algorithms for Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the propositional \(\mu\)-calculus
@@ Property / cites work: Results on the propositional \(\mu\)-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Memoryless Determinacy of Parity Games
@@ Property / cites work: Memoryless Determinacy of Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
+Normal rank
@@ Property / cites work @@
+Q4501540
@@ Property / cites work: Q4501540 / rank @@
+Normal rank
@@ Property / cites work @@
+Local model checking in the modal mu-calculus
@@ Property / cites work: Local model checking in the modal mu-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite games on finitely coloured graphs with applications to automata on infinite trees
+Normal rank