The following pages link to Fast and simple nested fixpoints (Q1350911):
Displaying 20 items.
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Games for synthesis of controllers with partial observation. (Q1401346) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- (Q3384882) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- (Q5089290) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
- Three notes on the complexity of model checking fixpoint logic with chop (Q5441546) (← links)
- Operations on fixpoint equation systems (Q6597955) (← links)
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms (Q6647769) (← links)
