Two polynomial problems in PLA folding

DOI10.1007/3-540-53832-1_37MaRDI QIDQ4028110zbMATH OpenFDO

Authors Claudio Arbib

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_37

zbMATH Keywords

compatibility graph of a PLAfolding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• PLA folding in special graph classes
• Graph models for PLA folding problems
• Graph theoretic analysis of PLA folding heuristics
• Compatibility relation algorithm for the folding of programmable logic arrays
• The Complexity of Near-Optimal Programmable Logic Array Folding

Cited in

(10)

• PLA folding in special graph classes
• On the orderability problem for PLA folding
• Graph theoretic analysis of PLA folding heuristics
• Compatibility relation algorithm for the folding of programmable logic arrays
• scientific article; zbMATH DE number 4149902 (Why is no real title available?)
• Bipartite convolution of a programmable logic array.
• Graph folding and programmable logic array
• The Complexity of Near-Optimal Programmable Logic Array Folding
• Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
• scientific article; zbMATH DE number 219249 (Why is no real title available?)

This page was built for publication: Two polynomial problems in PLA folding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028110)