On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas.

Ondrej Cepek, Stefan Gursk

Browse the full ISAIM paper archive.