12 citations · 23 across the 4 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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.CC2016
Complete Problems of Propositional Logic for the Exponential Hierarchy
Martin Lück
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic…