Pages that link to "Item:Q918700"

The following pages link to Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700):

Displaying 31 items.

• An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
• Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• Probabilistic performance of a heurisic for the satisfiability problem (Q1115189) (← links)
• The expected complexity of analytic tableaux analyses in propositional calculus. II (Q1353995) (← links)
• On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
• Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem (Q1596668) (← 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)
• Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
• Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
• Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
• Phase transition in a random NK landscape model (Q2389618) (← links)
• Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
• Phase transitions and the search problem (Q2674173) (← links)
• Some pitfalls for experimenters with random SAT (Q2674180) (← links)
• The scaling window of the 2-SAT transition (Q2725029) (← links)
• Selecting Complementary Pairs of Literals (Q3439115) (← links)
• The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← links)
• Walksat Stalls Well Below Satisfiability (Q5267998) (← links)
• On Super Strong ETH (Q5856463) (← links)
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses (Q5931554) (← links)
• Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)
• Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
• Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
• Upper bounds on the satisfiability threshold (Q5958807) (← links)
• Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)