Microcode Bit Optimization is NP-Complete
Robertson · IEEE Transactions on Computers · 1979
The general problem of formatting microinstructions so as to minimize the width of words in control memory is shown to be computationally difficult. Hence, we should not attempt to solve the general case, but concentrate on heuristics for reasonable subcases.