Binary decision tree test functions

DOI10.1109/12.8719zbMath0657.94024OpenAlexW1984087971MaRDI QIDQ3807134

S. Aborhey

Publication date: 1988

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

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

zbMATH Keywords

binary decision diagramslogic designoptimal treebinary decision algorithmsmultivariable logic functionsnode test functionspolarity test

Mathematics Subject Classification ID

Related Items

Efficient data structures for Boolean functions, On the size of binary decision diagrams representing Boolean functions, Graph driven BDDs -- a new data structure for Boolean functions, Lower bounds for linearly transformed OBDDs and FBDDs