This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Complexity of Horizontal Word Encoding in Microprogrammed Machines
October 1984 (vol. 33 no. 10)
pp. 938-939
R.A. Mueller, Department of Computer Science, Colorado State University
We consider the complexity of the problem of encoding microoperations into the fields of a control word on a horizontally microprogrammed machine, and show it to be NP-complete. The major result of this correspondence is a formalization of the microinstruction encoding problem, which makes the complexity argument straightforward.
Index Terms:
NP-completeness, Bit encodings, horizontal microinstructions, microprogramming
Citation:
R.A. Mueller, V.H. Allan, J. Varghese, "The Complexity of Horizontal Word Encoding in Microprogrammed Machines," IEEE Transactions on Computers, vol. 33, no. 10, pp. 938-939, Oct. 1984, doi:10.1109/TC.1984.1676358
Usage of this product signifies your acceptance of the Terms of Use.