Binary decision tree test functions

DOI10.1109/12.8719MaRDI QIDQ3807134zbMATH OpenOpenAlexFDO

Authors 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 algorithmsbinary decision diagramslogic designmultivariable logic functionsnode test functionsoptimal treepolarity test

Mathematics Subject Classification ID

Recommendations

• Synthesis of Minimal Binary Decision Trees
• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Multivariate decision trees
• scientific article; zbMATH DE number 4096781
• scientific article; zbMATH DE number 3976336

Cited in

(6)

• Efficient data structures for Boolean functions
• Lower bounds for linearly transformed OBDDs and FBDDs
• scientific article; zbMATH DE number 3936917 (Why is no real title available?)
• Synthesis of Minimal Binary Decision Trees
• On the size of binary decision diagrams representing Boolean functions
• Graph driven BDDs -- a new data structure for Boolean functions

This page was built for publication: Binary decision tree test functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3807134)