Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs

DOI10.1109/TC.1987.1676883zbMath0608.94013OpenAlexW1968208913MaRDI QIDQ3748965

Agnes Hui Chan

Publication date: 1987

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1987.1676883

zbMATH Keywords

Boolean functionsrecursive algorithmdisjunctive normal formmultiple-valued logiccomplement of logical expressionminimization of logical expressions

Mathematics Subject Classification ID

Related Items (1)

Study of the complexity of an algorithm to derive the complement of a binary function

This page was built for publication: Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs