Charles Explorer logo
🇬🇧

Dichotomy of the H-quasi-cover problem

Publication at Faculty of Mathematics and Physics |
2013

Abstract

We show a dichotomy theorem for the computational complexity of the H-quasicover problem