Cargando…
Quasipolynomial Computation of Nested Fixpoints
It is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires [Formula: see text] iterations of the function. Calude et al.’s recent quasipolynomial-t...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979196/ http://dx.doi.org/10.1007/978-3-030-72016-2_3 |