Simple and tight complexity lower bounds for solving Rabin games

DOI10.1137/1.9781611977936.16MaRDI QIDQ6545113zbMATH OpenFDO

Authors Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini

Publication date 29 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Simple and tight complexity lower bounds for solving Rabin games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545113)