The following pages link to HyperBench (Q5102056):
Displaying 5 items.
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Fractional covers of hypergraphs with bounded multi-intersection (Q6057846) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)