Recursive algorithm for parity games requires exponential time (Q3117548): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ita/2011124 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA/2011124 / rank | |||
Normal rank | |||
Latest revision as of 17:20, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive algorithm for parity games requires exponential time |
scientific article |
Statements
Recursive algorithm for parity games requires exponential time (English)
0 references
28 February 2012
0 references
parity games
0 references
recursive algorithm
0 references
lower bound
0 references
\(\mu\)-calculus
0 references
model checking
0 references
