The following pages link to (Q4952608):
Displaying 30 items.
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Estimating satisfiability (Q765341) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- Phase transition in a random NK landscape model (Q2389618) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- (Q2741515) (← links)
- D?E?K=(1000)8 (Q2772918) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- On the critical exponents of random <i>k</i>‐SAT (Q4803316) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825479) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
