Pages that link to "Item:Q903370"
From MaRDI portal
The following pages link to The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370):
Displaying 4 items.
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k ) (Q3507322) (← links)
