The following pages link to (Q3429018):
Displaying 8 items.
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- On propositional definability (Q2389643) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- Automata, Languages and Programming (Q5466546) (← links)