2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/151965A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.Computational Complexitytext