Pages that link to "Item:Q5073521"
From MaRDI portal
The following pages link to Deciding Parity Games in Quasi-polynomial Time (Q5073521):
Displaying 7 items.
- A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
- Continuous Positional Payoffs (Q6135780) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
- A matrix-based approach to parity games (Q6535384) (← links)
- Guessing winning policies in LTL synthesis by semantic learning (Q6535642) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)