Coverings of Boolean graphs
From MaRDI portal
Publication:3835757
Recommendations
- scientific article; zbMATH DE number 822063
- Mapping of reduced disjunctive normal forms onto graphs
- scientific article; zbMATH DE number 3904625
- Visualizing Boolean operations on a hypercube
- scientific article; zbMATH DE number 3853138
- scientific article; zbMATH DE number 30977
- Publication:4943285
- scientific article; zbMATH DE number 3957157
- scientific article; zbMATH DE number 4200277
- scientific article; zbMATH DE number 90561
Cited in
(15)- Visualizing Boolean operations on a hypercube
- On connected Boolean functions
- scientific article; zbMATH DE number 4168716 (Why is no real title available?)
- scientific article; zbMATH DE number 3904625 (Why is no real title available?)
- scientific article; zbMATH DE number 4027539 (Why is no real title available?)
- scientific article; zbMATH DE number 4093372 (Why is no real title available?)
- scientific article; zbMATH DE number 30977 (Why is no real title available?)
- scientific article; zbMATH DE number 1827836 (Why is no real title available?)
- scientific article; zbMATH DE number 822064 (Why is no real title available?)
- On the complexity of joint realization of Boolean functions regular systems in the DNF basis
- On the structure of strictly convex k-functions
- On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF
- Boolean graphs -- a survey
- A graph-theoretic method to define any Boolean operation on partitions
- On a class of Boolean functions with matroid property
This page was built for publication: Coverings of Boolean graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835757)