Pages that link to "Item:Q4608627"
From MaRDI portal
The following pages link to A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627):
Displaying 6 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335) (← links)
- Zero-One Designs Produce Small Hard SAT Instances (Q4931562) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)