Pages that link to "Item:Q4601867"
From MaRDI portal
The following pages link to Are Short Proofs Narrow? QBF Resolution is not Simple. (Q4601867):
Displaying 8 items.
- Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199) (← links)
- Relating size and width in variants of Q-resolution (Q1653019) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- (Q3304106) (← links)
- Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple (Q4608723) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)