APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Cheng, Kwang-Ting, and 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.

MLA (9th ed.) Citation

Cheng, Kwang-Ting, and 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.