12 citations · 14 across the 2 of their papers we have counts for
2 papers
cs.LO2016★ 12 cited
On Quantified Propositional Logics and the Exponential Time Hierarchy
Miika Hannula, Juha Kontinen, Martin Lück +1
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize…
cs.LO2014★ 2 cited
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
Martin Lück, Arne Meier, Irina Schindler
We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated…