Recursive algorithm for parity games requires exponential time (Q3117548): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PGSolver / rank | |||
Normal rank | |||
Revision as of 19:58, 28 February 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
