Pages that link to "Item:Q5145651"
From MaRDI portal
The following pages link to Lower Bounds for QBFs of Bounded Treewidth (Q5145651):
Displaying 9 items.
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- (Q3304106) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
- Reasoning in assumption-based argumentation using tree-decompositions (Q6545531) (← links)
- Tight double exponential lower bounds (Q6636075) (← links)