Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete

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]

Authors

Michal Zawidzki

This author has not been identified. Look up 'Michal Zawidzki' in Google

Renate A. Schmidt

This author has not been identified. Look up 'Renate A. Schmidt' in Google

Dmitry Tishkovsky

This author has not been identified. Look up 'Dmitry Tishkovsky' in Google