Heuristics for the Circuit Realization Problem

The Circuit Realization Problem has been previously shown to be NP-hard. We develop here several heuristics for the Circuit Realization Problem. These heuristics are locally optimal with respect to a transform and are f(n)-approximation algorithms. Several of the heuristics make use of a Statistical Mechanics technique for thermal equilibrium analysis in producing their solution. In addition, the heuristics are experimentally shown to have quite acceptable behavior.