Pages that link to "Item:Q4240602"
From MaRDI portal
The following pages link to Approximating the unsatisfiability threshold of random formulas (Q4240602):
Displayed 43 items.
- An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs (Q412366) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Phase transitions of contingent planning problem (Q474510) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Estimating satisfiability (Q765341) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← 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)
- Solution clustering in random satisfiability (Q978588) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- A fast parallel SAT-solver -- efficient workload balancing (Q1380435) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Phase transitions in discrete structures (Q1620869) (← links)
- A model of random industrial SAT (Q2118866) (← links)
- Proof of the satisfiability conjecture for large \(k\) (Q2171413) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- Super solutions of random \((3 + p)\)-SAT (Q2326395) (← links)
- Maximum independent sets on random regular graphs (Q2407501) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- (Q2741515) (← links)
- PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS (Q3069746) (← links)
- The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (Q3177360) (← links)
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story (Q3439112) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← links)
- Counting Solutions to Random CNF Formulas (Q5096442) (← links)
- (Q5111724) (← links)
- A NEW UPPER BOUND FOR RANDOM (2 + <i>p</i>)-SAT BY FLIPPING TWO VARIABLES (Q5401563) (← links)
- An asymptotic expansion for the<i>q</i>-binomial series using singularity analysis for generating functions (Q5421198) (← links)
- On the solution‐space geometry of random constraint satisfaction problems (Q5892482) (← links)
- Satisfiability threshold for power law random 2-SAT in configuration model (Q5896832) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Satisfiability threshold for random regular \textsc{nae-sat} (Q5963757) (← links)
- One-step replica symmetry breaking of random regular NAE-SAT. II (Q6119424) (← links)