Pages that link to "Item:Q2005578"
From MaRDI portal
The following pages link to Practical access to dynamic programming on tree decompositions (Q2005578):
Displaying 5 items.
- 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)
- (Q3386630) (← links)
- (Q5009490) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
