Pages that link to "Item:Q875598"
From MaRDI portal
The following pages link to Computational complexity of some restricted instances of 3-SAT (Q875598):
Displaying 19 items.
- On minimum reload cost cycle cover (Q496639) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem (Q1736511) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- On inverse chromatic number problems (extended abstract) (Q2861543) (← links)
- Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335) (← links)
- MRHS Equation Systems that can be Solved in Polynomial Time (Q2970278) (← links)
- On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (Q3002779) (← links)
- A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- (Q4375762) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
