The following pages link to (Q4411392):
Displaying 26 items.
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- 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)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- Solution clustering in random satisfiability (Q978588) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Probabilistic performance of a heurisic for the satisfiability problem (Q1115189) (← links)
- A probabilistic analysis of randomly generated binary constraint satisfaction problems. (Q1401196) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← 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)
- Stochastic analysis of greedy algorithms for the subset sum problem (Q1806779) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← 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)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- A probabilistic study on the satisfiability problem (Q2767440) (← links)
- A Probabilistic Analysis of Christofides’ Algorithm (Q2904559) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- (Q3686042) (← links)
- (Q3792480) (← links)
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← links)
- Survey propagation: An algorithm for satisfiability (Q5318246) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)