scientific article
From MaRDI portal
zbMath0801.68082MaRDI QIDQ3140436
Eli Upfal, Andrei Z. Broder, Alan M. Frieze
Publication date: 29 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A sharp threshold for a random constraint satisfaction problem, Sharp thresholds of graph properties, and the $k$-sat problem, Hardness of peeling with stashes, On threshold properties of \(k\)-SAT: An additive viewpoint, Performances of pure random walk algorithms on constraint satisfaction problems with growing domains, Cores in random hypergraphs and Boolean formulas, A Computing Procedure for Quantification Theory, Tail bounds for occupancy and the satisfiability threshold conjecture, Generating hard satisfiability problems, Experimental results on the crossover point in random 3-SAT, Hard random 3-SAT problems and the Davis-Putnam procedure, Analysis of edge deletion processes on faulty random regular graphs., Threshold saturation in spatially coupled constraint satisfaction problems, The cook-book approach to the differential equation method, On the Lower Bounds of Random Max 3 and 4-SAT, Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk, On the lower bounds of random Max 3 and 4-SAT, Random regular graphs with edge faults: Expansion through cores, Improved haplotype assembly using Xor genotypes, Statistical mechanics methods and phase transitions in optimization problems, Rigorous results for random (\(2+p)\)-SAT, Results related to threshold phenomena research in satisfiability: Lower bounds, Lower bounds for random 3-SAT via differential equations, Upper bounds on the satisfiability threshold, Pruning processes and a new characterization of convex geometries, The 3-XORSAT threshold., The probabilistic analysis of a greedy satisfiability algorithm, Belief propagation on the random \(k\)-SAT model, A sharp threshold for the renameable-Horn and the \(q\)-Horn properties, Typical case complexity of satisfiability algorithms and the threshold phenomenon, Selecting Complementary Pairs of Literals, An Empirical Study of MAX-2-SAT Phase Transitions, A perspective on certain polynomial-time solvable classes of satisfiability, Walksat Stalls Well Below Satisfiability
Uses Software
