Pages that link to "Item:Q2223685"
From MaRDI portal
The following pages link to On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685):
Displaying 11 items.
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- DNF tautologies with a limited number of occurrences of every variable (Q1575269) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Minimizing corners in colored rectilinear grids (Q6575390) (← links)
- Polarised random \(k\)-SAT (Q6632785) (← links)
