Pages that link to "Item:Q3637174"
From MaRDI portal
The following pages link to Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (Q3637174):
Displayed 7 items.
- Quantified maximum satisfiability (Q272016) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Anti-alignments in Conformance Checking – The Dark Side of Process Models (Q2822655) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)