The following pages link to (Q4739606):
Displaying 18 items.
- An improved generator for 3-CNF formulas (Q827897) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
- Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
- Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
- Phase transitions of PP-complete satisfiability problems. (Abstract) (Q2741517) (← links)
- Random MAX SAT, random MAX CUT, and their phase transitions (Q4739584) (← links)
- Theory and Applications of Satisfiability Testing (Q5325847) (← links)
- Theory and Applications of Satisfiability Testing (Q5325856) (← links)
- Theory and Applications of Satisfiability Testing (Q5325862) (← links)
- Theory and Applications of Satisfiability Testing (Q5713746) (← links)
- Theory and Applications of Satisfiability Testing (Q5713752) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900310) (← links)
