Pages that link to "Item:Q4821034"

The following pages link to The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034):

Displaying 50 items.

• Random \(\mathbb{Z}^d\)-shifts of finite type (Q316999) (← links)
• On the phase transitions of \((k, q)\)-SAT (Q517195) (← links)
• On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
• The mean field traveling salesman and related problems (Q617874) (← links)
• Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
• The set of solutions of random XORSAT formulae (Q748322) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
• The asymptotic \(k\)-SAT threshold (Q900872) (← links)
• Solution clustering in random satisfiability (Q978588) (← links)
• Phase transitions in discrete structures (Q1620869) (← links)
• Charting the replica symmetric phase (Q1749356) (← links)
• On the lower bounds of random Max 3 and 4-SAT (Q1752631) (← links)
• A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
• Spin systems on Bethe lattices (Q2008960) (← links)
• Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
• Belief propagation on the random \(k\)-SAT model (Q2090606) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• A model of random industrial SAT (Q2118866) (← links)
• Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities (Q2211648) (← links)
• Optimal testing for planted satisfiability problems (Q2259537) (← links)
• On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
• Waiter-client and client-waiter colourability and \(k\)-SAT games (Q2363109) (← links)
• Pairs of SAT-assignments in random Boolean formulæ (Q2481970) (← links)
• The structure of the set of satisfying assignments for a random \(k\)-CNF (Q2519391) (← links)
• An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
• On the number of circuits in random graphs (Q2903740) (← links)
• On the concentration of the number of solutions of random satisfiability formulas (Q2930051) (← links)
• Harnessing the Bethe free energy (Q2953696) (← links)
• The Decimation Process in Random k-SAT (Q3012815) (← links)
• Independent Sets in Random Graphs from the Weighted Second Moment Method (Q3088119) (← links)
• The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (Q3177360) (← links)
• The large deviations of the whitening process in random constraint satisfaction problems (Q3302666) (← links)
• Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
• Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
• On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
• Branching Process Approach for 2-Sat Thresholds (Q4933200) (← links)
• Geometrical organization of solutions to random linear Boolean equations (Q4968895) (← links)
• The replica symmetric phase of random constraint satisfaction problems (Q4993097) (← links)
• (Q5091194) (← links)
• Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
• Walksat Stalls Well Below Satisfiability (Q5267998) (← links)
• Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911) (← links)
• On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT (Q5384461) (← links)
• A NEW UPPER BOUND FOR RANDOM (2 + <i>p</i>)-SAT BY FLIPPING TWO VARIABLES (Q5401563) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• The condensation transition in random hypergraph 2-coloring (Q5743395) (← links)