The following pages link to (Q4250220):
Displaying 11 items.
- An improved upper bound for SAT (Q820534) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Separating signs in the propositional satisfiability problem (Q1977918) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
