Pages that link to "Item:Q4876696"

The following pages link to Analysis of Two Simple Heuristics on a Random Instance ofk-sat (Q4876696):

Displaying 44 items.

• A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
• The cook-book approach to the differential equation method (Q465658) (← links)
• Phase transitions of contingent planning problem (Q474510) (← links)
• Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
• On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
• The asymptotic \(k\)-SAT threshold (Q900872) (← links)
• Finite size scaling for the core of large random hypergraphs (Q957528) (← links)
• Solution clustering in random satisfiability (Q978588) (← links)
• A fast parallel SAT-solver -- efficient workload balancing (Q1380435) (← 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 perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
• A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
• A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
• Satisfiability threshold for random XOR-CNF formulas (Q1961446) (← links)
• Belief propagation on the random \(k\)-SAT model (Q2090606) (← links)
• Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
• Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
• Waiter-client and client-waiter colourability and \(k\)-SAT games (Q2363109) (← links)
• Maximum independent sets on random regular graphs (Q2407501) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
• The scaling window of the 2-SAT transition (Q2725029) (← links)
• The Decimation Process in Random k-SAT (Q3012815) (← links)
• Selecting Complementary Pairs of Literals (Q3439115) (← links)
• On independent sets in random graphs (Q3452727) (← links)
• Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
• The phase transition in random horn satisfiability and its algorithmic implications (Q4543632) (← links)
• (Q4704799) (← links)
• The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← 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)
• Deep learning: a statistical viewpoint (Q5887827) (← links)
• On the solution‐space geometry of random constraint satisfaction problems (Q5892482) (← links)
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses (Q5931554) (← links)
• Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
• Random 2-SAT: Results and problems (Q5958804) (← 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)
• Bounding the scaling window of random constraint satisfaction problems (Q5963651) (← links)
• Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity (Q6633135) (← links)