2 papers
cs.GT2023
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games
Paweł Parys, Aleksander Wiącek
We improve the complexity of solving parity games (with priorities in vertices) for by a factor of : the best complexity known to date was $O(mdn^{1.45+\log_2…
cs.LO2017
Intersection Types and Counting
Paweł Parys
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an in…