Abstract: The problem of counting all inequivalent monotone Boolean functions of nine variables is considered. We solve the problem using known algorithms and deriving new ones when necessary. We ...

Abstract: Boolean resubstitution is a widely recognized and utilized optimization algorithm for logic networks. In this paper, we present an enhancement to the traditional resubstitution approach by ...

Allowing number fields to be .as('hidden'). While we're here, also allowing boolean fields, since there is special-case handling for those.