Pages that link to "Item:Q877837"
From MaRDI portal
The following pages link to An efficient approach to solving random \(k\)-SAT problems (Q877837):
Displaying 14 items.
- A collaborative approach for multi-threaded SAT solving (Q839500) (← links)
- A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- (Q3429157) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- (Q4529982) (← links)
- (Q4530863) (← links)
- (Q4708577) (← links)
- Theory and Applications of Satisfiability Testing (Q5325884) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- Theory and Applications of Satisfiability Testing (Q5714749) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900310) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
