作者: Michael Theobald , Steven M. Nowick , Tao Wu
关键词:
摘要: We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the finds an exactly minimum-cost cover. It also solves several problems which have not been previously solved using existing exact minimizers. believe this is first method based on Espresso to solve general problem, multiple-input change transitions.