From post

Parameterized complexity of decision problems in non-classical logics

. University of Hanover, Germany, (2018)base-search.net (ftunivhannover:oai:www.repo.uni-hannover.de:123456789/3602).

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Parametrised Complexity of Satisfiability in Temporal Logic., , и . ACM Trans. Comput. Log., 18 (1): 1:1-1:32 (2017)Strong Backdoors for Linear Temporal Logic., , , и . CoRR, (2016)Backdoors for Linear Temporal Logic., , , и . IPEC, том 63 из LIPIcs, стр. 23:1-23:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized complexity of decision problems in non-classical logics. University of Hanover, Germany, (2018)base-search.net (ftunivhannover:oai:www.repo.uni-hannover.de:123456789/3602).