This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computational Work of Combinational Machines
November 1977 (vol. 26 no. 11)
pp. 1161-1163
K. Ecker, Gesellschaft f?r Mathematik und Datenverarbeitung
In this correspondence we discuss an application of a work measure introduced by Hellerman. Uniform machines are represented by chains of transformations of Boolean functions. The work of any transformation depends only on the rank of a corresponding Boolean matrix.
Index Terms:
Boolean matrix, combinational complexity, combinational machine (logic circuit), computational work of processes, transformation of Boolean functions.
Citation:
K. Ecker, D. Schutt, "Computational Work of Combinational Machines," IEEE Transactions on Computers, vol. 26, no. 11, pp. 1161-1163, Nov. 1977, doi:10.1109/TC.1977.1674768
Usage of this product signifies your acceptance of the Terms of Use.