Pages that link to "Item:Q4037693"

The following pages link to One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete (Q4037693):

Displaying 22 items.

• A simplified NP-complete MAXSAT problem (Q293164) (← links)
• The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
• Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
• The \(k\)-SATISFIABILITY problem remains NP-complete for dense families (Q1322290) (← links)
• Algorithmic complexity of list colorings (Q1327214) (← links)
• DNF tautologies with a limited number of occurrences of every variable (Q1575269) (← links)
• On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
• On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
• Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
• Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
• XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
• Satisfiability with index dependency (Q2637283) (← links)
• Efficient computation of sparse structures (Q2820273) (← links)
• Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
• A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
• How Many Conflicts Does It Need to Be Unsatisfiable? (Q3502712) (← links)
• Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
• A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
• The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant (Q6158363) (← links)