Pages that link to "Item:Q1949746"
From MaRDI portal
The following pages link to On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746):
Displaying 4 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction (Q701734) (← links)
- Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
- The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)