scientific article; zbMATH DE number 437557
From MaRDI portal
Publication:3140436
Recommendations
- scientific article; zbMATH DE number 2079359
- A spectral technique for random satisfiable 3CNF formulas
- scientific article; zbMATH DE number 1445295
- Bounding the unsatisfiability threshold of random 3-SAT
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
- Exponential lower bounds for DPLL algorithms on satisfiable random 3-CNF formulas
- On the maximum satisfiability of random formulas
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Randomized algorithms for 3-SAT
Cited in
(52)- Pruning processes and a new characterization of convex geometries
- An exponential lower bound for the pure literal rule
- Analysis of edge deletion processes on faulty random regular graphs.
- The 3-XORSAT threshold.
- On the lower bounds of random Max 3 and 4-SAT
- Improved haplotype assembly using Xor genotypes
- A perspective on certain polynomial-time solvable classes of satisfiability
- A sharp threshold for a random constraint satisfaction problem
- Threshold saturation in spatially coupled constraint satisfaction problems
- Belief propagation on the random \(k\)-SAT model
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Hardness of peeling with stashes
- Generating hard satisfiability problems
- Experimental results on the crossover point in random 3-SAT
- Hard random 3-SAT problems and the Davis-Putnam procedure
- scientific article; zbMATH DE number 5899254 (Why is no real title available?)
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
- Selecting Complementary Pairs of Literals
- An Empirical Study of MAX-2-SAT Phase Transitions
- Partial Satisfaction of k-Satisfiable Formulas
- On the maximum satisfiability of random formulas
- Sharp thresholds of graph properties, and the k-sat problem
- scientific article; zbMATH DE number 1113997 (Why is no real title available?)
- scientific article; zbMATH DE number 1947423 (Why is no real title available?)
- scientific article; zbMATH DE number 2079359 (Why is no real title available?)
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
- Bounding the unsatisfiability threshold of random 3-SAT
- On the Lower Bounds of Random Max 3 and 4-SAT
- The cook-book approach to the differential equation method
- The probability of pure literals
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Non‐orderability of random triangular groups by using random 3CNF formulas
- Conditional hardness for satisfiable 3-CSPs
- Walksat Stalls Well Below Satisfiability
- Computer Science Logic
- Cores in random hypergraphs and Boolean formulas
- Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs
- The probabilistic analysis of a greedy satisfiability algorithm
- The pure literal rule threshold and cores in random hypergraphs
- A Computing Procedure for Quantification Theory
- Random regular graphs with edge faults: Expansion through cores
- 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
- Sufficient condition for polynomial solvability of random 3-CNF formulas
- \texttt{WalkSAT} is linear on random 2-SAT
- On the satisfiability of random 3-SAT formulas with \(k\)-wise independent clauses
- On threshold properties of k-SAT: An additive viewpoint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140436)
