The following pages link to (Q3140436):
Displaying 45 items.
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- Pruning processes and a new characterization of convex geometries (Q1025925) (← links)
- An exponential lower bound for the pure literal rule (Q1104093) (← links)
- Analysis of edge deletion processes on faulty random regular graphs. (Q1401301) (← links)
- The 3-XORSAT threshold. (Q1565907) (← links)
- On the lower bounds of random Max 3 and 4-SAT (Q1752631) (← links)
- Improved haplotype assembly using Xor genotypes (Q1784030) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- Threshold saturation in spatially coupled constraint satisfaction problems (Q1949335) (← links)
- Belief propagation on the random \(k\)-SAT model (Q2090606) (← links)
- The structure of the set of satisfying assignments for a random \(k\)-CNF (Q2519391) (← 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)
- Hardness of peeling with stashes (Q2630336) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Experimental results on the crossover point in random 3-SAT (Q2674177) (← links)
- Hard random 3-SAT problems and the Davis-Putnam procedure (Q2674184) (← links)
- (Q3002778) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- Partial Satisfaction of k-Satisfiable Formulas (Q3503510) (← links)
- Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
- (Q4375762) (← links)
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk (Q4487074) (← links)
- Bounding the unsatisfiability threshold of random 3-SAT (Q4511484) (← links)
- On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
- The probability of pure literals (Q4700097) (← links)
- Tail bounds for occupancy and the satisfiability threshold conjecture (Q4847396) (← links)
- Non‐orderability of random triangular groups by using random 3CNF formulas (Q5021647) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- Walksat Stalls Well Below Satisfiability (Q5267998) (← links)
- Computer Science Logic (Q5311247) (← links)
- Cores in random hypergraphs and Boolean formulas (Q5311914) (← links)
- The probabilistic analysis of a greedy satisfiability algorithm (Q5486323) (← links)
- A Computing Procedure for Quantification Theory (Q5613969) (← links)
- Random regular graphs with edge faults: Expansion through cores (Q5941563) (← links)
- Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)
- Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Sufficient condition for polynomial solvability of random 3-CNF formulas (Q6644123) (← links)
