Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
Komplexitätsmaße für Ausdrücke
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
The Power and Efficiency of a Computer System ( invited )
Fachtagung Struktur und Betrieb von Rechensystemen
On a proposed measure of program structure
ACM SIGPLAN Notices
A Measure of Computational Work
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.