Pierluigi Nuzzo, Nikunj Bajaj, et al.
IEEE TCADIS
Paper
An Algorithm for Optimal PLA Folding
Abstract
In this paper we present a graph-theoretic formulation of the optimal PLA folding problem. The class of admissible PLA foldings is defined. Necessary and sufficient conditions for obtaining the optimal folding are given. A subproblem of the optimal problem is shown to be NP-complete, and a heuristic algorithm is given which has proven to be effective on a number of test problems. © 1982 IEEE
Related
Gary D. Hachtel, Ronald Alan Rohrer
Proceedings of the IEEE
Robert K. Brayton, A. Richard Newton, et al.
IEEE TC
Robert K. Brayton, Gary D. Hachtel, et al.
Proceedings of the IEEE