The following pages link to (Q2768371):
Displayed 16 items.
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- The scaling window of the model \(d\)-\(k\)-CSP (Q890505) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- The satisfiability threshold for random linear equations (Q2003764) (← links)
- Proof of the satisfiability conjecture for large \(k\) (Q2171413) (← links)
- Maximum independent sets on random regular graphs (Q2407501) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- Phase Transition for Maximum Not-All-Equal Satisfiability (Q4632221) (← links)
- The replica symmetric phase of random constraint satisfaction problems (Q4993097) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
- Geometric properties of satisfying assignments of random ε-1-in-<i>k</i>SAT (Q5850753) (← links)
- Satisfiability threshold for random regular \textsc{nae-sat} (Q5963757) (← links)
- The number of satisfying assignments of random 2‐SAT formulas (Q6074640) (← links)