The best asymptotic representation of Boolean functions by information graphs
Diskretnaya Matematika, Tome 23 (2011) no. 4, pp. 80-102
@article{DM_2011_23_4_a5,
author = {Yu. S. Shutkin},
title = {The best asymptotic representation of {Boolean} functions by information graphs},
journal = {Diskretnaya Matematika},
pages = {80--102},
year = {2011},
volume = {23},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/}
}
Yu. S. Shutkin. The best asymptotic representation of Boolean functions by information graphs. Diskretnaya Matematika, Tome 23 (2011) no. 4, pp. 80-102. http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/
[1] Lupanov O. B., “O ventilnykh i kontaktno-ventilnykh skhemakh”, Dokl. AN SSSR, 111:6 (1956), 1171–1174 | MR | Zbl
[2] Gasanov E. E., Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002 | Zbl
[3] Shutkin Yu. S., “O realizatsii bulevykh funktsii informatsionnymi grafami”, Diskretnaya matematika, 20:4 (2008), 29–41 | MR | Zbl