Pages that link to "Item:Q955019"
From MaRDI portal
The following pages link to Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019):
Displaying 6 items.
- On the complexity of quantified linear systems (Q391791) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- (Q3429018) (← links)
- Complexity and expressive power of second‐order extended Horn logic (Q4915214) (← links)