The following pages link to (Q4252729):
Displayed 10 items.
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)
- Guided Search and a Faster Deterministic Algorithm for 3-SAT (Q5458517) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- Frozen development in graph coloring (Q5958809) (← links)