A New Proof of Stetsenko's Theorem

摘要

A short proof of V.A. Stetsenko's theorem on weakly read-many Boolean functions is given, which is based on the technique of representing read-once functions in the form of trees.