On the realisation of Boolean functions by informational graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- On the realisation of Boolean functions by informational graphs
- scientific article; zbMATH DE number 3877096 (Why is no real title available?)
- scientific article; zbMATH DE number 4168716 (Why is no real title available?)
- scientific article; zbMATH DE number 4061156 (Why is no real title available?)
- scientific article; zbMATH DE number 4091416 (Why is no real title available?)
- scientific article; zbMATH DE number 1294417 (Why is no real title available?)
- scientific article; zbMATH DE number 512939 (Why is no real title available?)
- The best asymptotic representation of Boolean functions by information graphs
- The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
- A Picture for Complex Stochastic Boolean Systems: The Intrinsic Order Graph
- On the Delay Required to Realize Boolean Functions
- Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes
This page was built for publication: On the realisation of Boolean functions by informational graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184572)