For very large problems which HFMIN is unable to solve in reasonable
time, MINIMALIST offers ESPRESSO-HF [29],
a new fast heuristic two-level logic minimizer. ESPRESSO-HF uses an
algorithm loosely based on ESPRESSO (but substantially different from
it), to solve problems with up to 32 inputs and 33 outputs. On benchmark examples,
ESPRESSO-HF can find very good covers -- at most 
larger
than a minimum-size cover -- in less than 105 seconds. For typical examples,
ESPRESSO-HF obtains an exact or near-exact result in under 3 seconds.
Currently, ESPRESSO-HF only implements multi-output minimization targetting product cardinality, and so it is normally used only for designs which exceed HFMIN's capacity. However, output-disjoint or single-output minimization can easily be implemented by a trivial modification of the code, and will be available in future releases of MINIMALIST.