Pages that link to "Item:Q2223685"

The following pages link to On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685):

Displaying 3 items.

• Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• On the approximation hardness of geodetic set and its variants (Q2695276) (← links)