Abstract
Block-folding and variable-folding are widely used techniques for reducing the physical area of Programmed Logic Arrays (PLA). Both block-and variable-folding problems are known to be NP-hard. We define the compatibility graph of a PLA as the complement of its column-disjoint graph, and prove that both block-folding and variable-folding can be solved in polynomial time on PLA whose compatibility graph does not contain a claw or a (K5 − e) as induced subgraph.
Cite
CITATION STYLE
Arbib, C. (1991). Two polynomial problems in PLA folding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 484 LNCS, pp. 119–129). Springer Verlag. https://doi.org/10.1007/3-540-53832-1_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
