IPSJ Transactions on System LSI Design Methodology Vol. 4 70–79 (Feb. 2011)
Regular Paper
Exact Minimum Factoring of Incompletely Specified
Logic Functions via Quantified Boolean Satisfiability
Hiroaki Yoshida1 and Masahiro Fujita1
This paper presents an exact method which finds the minimum factored form
of an incompletely specified Boolean function. The problem is formulated as
a Quantified Boolean Formula (QBF) and is solved by general-purpose QBF
solve ...


雷达卡


京公网安备 11010802022788号







