Approximating the minimal lookahead needed to win infinite games (Q2671807)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7537423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimal lookahead needed to win infinite games |
scientific article; zbMATH DE number 7537423 |
Statements
Approximating the minimal lookahead needed to win infinite games (English)
0 references
3 June 2022
0 references
formal methods
0 references
theory of computation
0 references
delay games
0 references
approximation algorithm
0 references
infinite games
0 references
