Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Dmitry Tishkovsky
Information about the author Dmitry Tishkovsky will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
2013
This paper provides a proof of NExpTime ‐completeness of the satisfiability...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
