Negation trees: a unified approach to Boolean function complementation

DOI10.1109/12.509916MaRDI QIDQ4420972zbMATH OpenOpenAlexFDO

Authors Yuke Wang, Carl McCrosky

Publication date 1996

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

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

zbMATH Keywords

complementation algorithmsnegation trees

Mathematics Subject Classification ID

Boolean functions (06E30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A new complementation algorithm
• scientific article; zbMATH DE number 3894983
• An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 3894979

Cited in

(2)

• Associative and commutative tree representations for Boolean functions
• A new complementation algorithm

This page was built for publication: Negation trees: a unified approach to Boolean function complementation

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