IEEE Transactions on Computers · 1972 · 11 citations · 0 references
Natural SciencesComputer ScienceMathematicsLogicSet TheoryTheory Of ComputationAxiomatic Set TheoryBoolean AlgebraBoolean OperationsDigital Logic DesignLogic SynthesisPredicate LogicBoolean Function RepresentationBoolean FunctionsComplexity Of Boolean Functions
A theorem is presented that simplifies the computations necessary for complementing a Boolean function.