We investigate the complexity of the model-checking problem for a family of modal logics capturing the notion of "knowing how". We consider the most standard abilitybased knowing how logic, for which we show that modelchecking is PSpace-complete. By contrast, a multi-agent variant based on an uncertainty relation between plans in which uncertainty is encoded by a regular language, is shown to admit a PTime model-checking problem. We extend with budgets the above-mentioned ability-logics, as done for ATLlike logics. We show that for the former logic enriched with budgets, the complexity increases to at least ExpSpacehardness, whereas for the latter, the PTime bound is preserved. Other variant logics are discussed along the paper. (also available at https://ojs.aaai.org/index.php/AAAI/article/view/25776)