The Complexity of Near-Optimal Programmable Logic Array Folding

DOI10.1137/0217045zbMath0651.68051OpenAlexW1995031045MaRDI QIDQ3796745

Errol L. Lloyd, S. S. Ravi

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

heuristicsVLSINP-completefoldingprogrammable logic arrayPLA

Mathematics Subject Classification ID

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

Related Items (5)

Graph theoretic analysis of PLA folding heuristics ⋮ General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem ⋮ Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs ⋮ On the orderability problem for PLA folding ⋮ New heuristic approaches for maximum balanced biclique problem

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