An entropy measure for the complexity of multi-output Boolean functions
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 302-305
- https://doi.org/10.1109/dac.1990.114870
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- MUSTANG: state assignment of finite state machines targeting multilevel logic implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- An Information Theoretic Approach to Digital Fault TestingIEEE Transactions on Computers, 1981
- State assignment and entropyElectronics Letters, 1978
- An algorithm for the state assignment of synchronous sequential circuitsElectronics Letters, 1978
- Comments on "A Measure of Computational Work" and "Logical Network Cost and Entropy"IEEE Transactions on Computers, 1978
- Information theory and the complexity of boolean functionsTheory of Computing Systems, 1976
- Logical Network Cost and EntropyIEEE Transactions on Computers, 1973
- A Measure of Computational WorkIEEE Transactions on Computers, 1972
- A Formula for Logical Network CostIEEE Transactions on Computers, 1968