Abstract
THE PROBLEM of finding a monotonic Boolean function best approximation a specified partial (not defined everywhere) Boolean function, is solved by a flow algorithm. Among the monotonic functions giving the best approximation, the function possessing the simplest disjunctive normal form is chosen.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have