Michal Zawidzki, Renate A. Schmidt, Dmitry Tishkovsky. Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete. Inf. Process. Lett., 113(1-2):34-38, 2013. [doi]
@article{ZawidzkiST13,
title = {Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete},
author = {Michal Zawidzki and Renate A. Schmidt and Dmitry Tishkovsky},
year = {2013},
doi = {10.1016/j.ipl.2012.09.007},
url = {http://dx.doi.org/10.1016/j.ipl.2012.09.007},
researchr = {https://researchr.org/publication/ZawidzkiST13},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {34-38},
}