Before revision:  We provide a thorough complexity analysis (NP-hardness proofs and pseudo-polynomial algorithms) for different members of these three classes.
After revision:  We provide a thorough complexity analysis (NP-hardness proofs and (pseudo-)polynomial algorithms) for different members of these three classes.