A technique to speed up symmetric attractor-based algorithms for parity games
KS Thejaswini, P Ohlmann… - Proceedings of the 42nd …, 2022 - wrap.warwick.ac.uk
The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
[PDF][PDF] A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann, M Jurdziński - 42nd IARCS Annual …, 2022 - cs.emis.de
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann… - 42nd IARCS Annual …, 2022 - drops.dagstuhl.de
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
[PDF][PDF] A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann, M Jurdziński - scholar.archive.org
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
[PDF][PDF] A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann, M Jurdziński - 42nd IARCS Annual …, 2022 - d-nb.info
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
[PDF][PDF] A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann, M Jurdziński - cs.emis.de
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
[PDF][PDF] A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
KS Thejaswini, P Ohlmann… - 42nd IARCS Annual …, 2022 - drops.dagstuhl.de
Abstract The classic McNaughton-Zielonka algorithm for solving parity games has excellent
performance in practice, but its worst-case asymptotic complexity is worse than that of the …
performance in practice, but its worst-case asymptotic complexity is worse than that of the …