DocumentCode :
1133884
Title :
Computational Work of Combinational Machines
Author :
Ecker, K. ; Schütt, D.
Author_Institution :
Gesellschaft für Mathematik und Datenverarbeitung
Issue :
11
fYear :
1977
Firstpage :
1161
Lastpage :
1163
Abstract :
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.
Keywords :
Boolean matrix, combinational complexity, combinational machine (logic circuit), computational work of processes, transformation of Boolean functions.; Boolean functions; Logic circuits; Matrices; Boolean matrix, combinational complexity, combinational machine (logic circuit), computational work of processes, transformation of Boolean functions.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1977.1674768
Filename :
1674768
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1133884
بازگشت