Pages that link to "Item:Q4825480"
From MaRDI portal
The following pages link to Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480):
Displaying 9 items.
- The 3-XORSAT threshold. (Q1565907) (← links)
- Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT (Q1656585) (← links)
- Satisfiability threshold for random XOR-CNF formulas (Q1961446) (← links)
- Pairs of SAT-assignments in random Boolean formulæ (Q2481970) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Threshold properties of random Boolean constraint satisfaction problems (Q2581551) (← links)
- Approximating the Satisfiability Threshold for Random k-XOR-formulas (Q4802163) (← links)
- Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных (Q4959031) (← links)
- Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (Q6083522) (← links)