Visualizing Boolean operations on a hypercube

DOI10.1016/0895-7177(94)00166-9zbMATH Open0824.68085OpenAlexW2053533125MaRDI QIDQ1344641FDOQ1344641

Authors: M. C. Clarke 

Publication date: 13 February 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)00166-9

Recommendations

• Graph-Based Algorithms for Boolean Function Manipulation
• Coverings of Boolean graphs
• Directed projection graph of \(N\)-dimensional hypercube and subhypercube decomposition of balanced linearly separable Boolean functions
• scientific article; zbMATH DE number 2209835
• scientific article; zbMATH DE number 4200277

zbMATH Keywords

hypercubeBoolean function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A survey of the theory of hypercube graphs
• Title not available (Why is that?)

Cited In (5)

• A graph-theoretic method to define any Boolean operation on partitions
• Title not available (Why is that?)
• Binary predicates as representations of Boolean logic objects.
• Directed projection graph of \(N\)-dimensional hypercube and subhypercube decomposition of balanced linearly separable Boolean functions
• Coverings of Boolean graphs

This page was built for publication: Visualizing Boolean operations on a hypercube

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