Pages that link to "Item:Q4360139"
From MaRDI portal
The following pages link to A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae (Q4360139):
Displayed 26 items.
- 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)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013) (← links)
- Solution clustering in random satisfiability (Q978588) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- Pairs of SAT-assignments in random Boolean formulæ (Q2481970) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Random <i>k</i> -SAT and the power of two choices (Q3192377) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- New Results on the Phase Transition for Random Quantified Boolean Formulas (Q3502691) (← links)
- (Q4704799) (← links)
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← links)
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT (Q5034546) (← links)
- Exact location of the phase transition for random (1,2)-QSAT (Q5245725) (← 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)
- Random 2-SAT: Results and problems (Q5958804) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Biased random <i>k</i>‐SAT (Q6074657) (← links)