The following pages link to A new upper bound for 3-SAT (Q3165956):
Displaying 10 items.
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- New upper bound for the \#3-SAT problem (Q2380029) (← links)
- A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
- (Q4375761) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT (Q5034546) (← links)
