Pages that link to "Item:Q2888335"
From MaRDI portal
The following pages link to Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335):
Displaying 5 items.
- A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem (Q1736511) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)