Pages that link to "Item:Q4257709"
From MaRDI portal
The following pages link to Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709):
Displaying 50 items.
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- Random \(\mathbb{Z}^d\)-shifts of finite type (Q316999) (← links)
- Combinatorial theorems in sparse random sets (Q350550) (← links)
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs (Q412366) (← links)
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- On sharp transitions in making squares (Q431647) (← links)
- A structure theorem for Boolean functions with small total influences (Q447936) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Phase transitions of contingent planning problem (Q474510) (← links)
- Thresholds and expectation-thresholds of monotone properties with small minterms (Q491531) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
- On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
- Random 2 XORSAT phase transition (Q627513) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← 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)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- Bootstrap percolation on the hypercube (Q818817) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality (Q858978) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Gibbs measures and phase transitions on sparse random graphs (Q985984) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- Weak lumpability in the \(k\)-SAT problem (Q1585561) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- Phase transitions in discrete structures (Q1620869) (← links)
- Around two theorems and a lemma by Lucio Russo (Q1648777) (← links)
- A stability result for the cube edge isoperimetric inequality (Q1689050) (← links)
- The junta method in extremal hypergraph theory and Chvátal's conjecture (Q1689997) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? (Q1700408) (← links)
- On a biased edge isoperimetric inequality for the discrete cube (Q1713503) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← 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)
- On the distribution of the Fourier spectrum of Boolean functions (Q1852725) (← 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)
- Thresholds versus fractional expectation-thresholds (Q1983096) (← links)
