Pages that link to "Item:Q557836"

The following pages link to Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836):

Displaying 9 items.

• Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
• DNF tautologies with a limited number of occurrences of every variable (Q1575269) (← links)
• On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
• Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
• Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for<i>K</i>-SAT at large clause-to-variable ratios (Q3425245) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
• Zero-One Designs Produce Small Hard SAT Instances (Q4931562) (← links)
• Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
• The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant (Q6158363) (← links)