7 citations · 8 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LO2026
On Proof Systems for #QBF
Sravanthi Chede, Leroy Chew, Vaibhav Krishan +1
For a quantified Boolean formula (QBF), the problem of computing the number of winning strategies is known as the #QBF problem. This problem is considered harder than the analogous…
cs.LO2026
Reintroducing the Second Player in EPR
Leroy Chew, Mikoláš Janota, Miroslav Olšák +1
We present a PSPACE-complete fragment of first order logic we call QEALM (QBF-like EPR by Alternating Level-ordered Miniscoping). Unlike other well-known fragments it is closer to…