The Complexity of Near-Optimal Programmable Logic Array Folding

DOI10.1137/0217045MaRDI QIDQ3796745zbMATH OpenOpenAlexFDO

Authors S. S. Ravi, Errol L. Lloyd

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217045

zbMATH Keywords

heuristicsfoldingNP-completeVLSIprogrammable logic arrayPLA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph theoretic analysis of PLA folding heuristics
• Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
• scientific article; zbMATH DE number 139785
• PLA folding in special graph classes
• scientific article; zbMATH DE number 4070608

Cited in

(14)

• Graph theoretic analysis of PLA folding heuristics
• Algorithmic folding complexity
• Graph folding and programmable logic array
• Efficient segment folding is hard
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
• scientific article; zbMATH DE number 139785 (Why is no real title available?)
• Bipartite convolution of a programmable logic array.
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
• Suboptimal solution for PLA multiple column folding
• New heuristic approaches for maximum balanced biclique problem
• Exact algorithms for the maximum k-balanced weighted biclique problem
• On the orderability problem for PLA folding
• scientific article; zbMATH DE number 3863114 (Why is no real title available?)
• Array Folds Logic

This page was built for publication: The Complexity of Near-Optimal Programmable Logic Array Folding

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