156 citations · 159 across the 4 of their papers we have counts for
1 paper · 2 filters
Richard Beigel, David Eppstein
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction…