2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/104415In this paper is presented an heuristic that, in polynomial time and space in the input dimension, determines if a circuit describes a tautology or a contradiction. If the circuit is neither a tautology nor a contradiction, then the heuristic finds an assignment to the circuit inputs such that the circuit is satisfied.20 pages, 8 figuresComputational ComplexityData Structures and Algorithmstext