Pages that link to "Item:Q3425245"
From MaRDI portal
The following pages link to Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for<i>K</i>-SAT at large clause-to-variable ratios (Q3425245):
Displaying 4 items.
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- Complete convergence of message passing algorithms for some satisfiability problems (Q3191589) (← links)
- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems (Q3595409) (← links)