Pages that link to "Item:Q3439115"
From MaRDI portal
The following pages link to Selecting Complementary Pairs of Literals (Q3439115):
Displaying 11 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- Solution clustering in random satisfiability (Q978588) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Random <i>k</i> -SAT and the power of two choices (Q3192377) (← links)
- On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT (Q5384461) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
- On the solution‐space geometry of random constraint satisfaction problems (Q5892482) (← links)
