Cheng, K., & Agrawal, V. D. (1991, January 3). An entropy measure for the complexity of multi-output Boolean functions. Proceedings of the 27th ACM/IEEE Design Automation Conference, 302-305. https://doi.org/10.1145/123186.123282
Citace podle Chicago (17th ed.)Cheng, Kwang-Ting, a Vishwani D. Agrawal. "An Entropy Measure for the Complexity of Multi-output Boolean Functions." Proceedings of the 27th ACM/IEEE Design Automation Conference 3 Jan. 1991: 302-305. https://doi.org/10.1145/123186.123282.
Citace podle MLA (9th ed.)Cheng, Kwang-Ting, a Vishwani D. Agrawal. "An Entropy Measure for the Complexity of Multi-output Boolean Functions." Proceedings of the 27th ACM/IEEE Design Automation Conference, 3 Jan. 1991, pp. 302-305, https://doi.org/10.1145/123186.123282.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..