The following pages link to (Q3576756):
Displayed 4 items.
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Why almost all \(k\)-colorable graphs are easy to color (Q968270) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- On Super Strong ETH (Q5856463) (← links)