The following pages link to (Q4375761):
Displaying 10 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- Separating signs in the propositional satisfiability problem (Q1977918) (← links)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- (Q4989407) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
