The Complexity of Near-Optimal Programmable Logic Array Folding
From MaRDI portal
Recommendations
Cited in
(16)- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- On the orderability problem for PLA folding
- Efficient segment folding is hard
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- Graph theoretic analysis of PLA folding heuristics
- scientific article; zbMATH DE number 3863114 (Why is no real title available?)
- Compatibility relation algorithm for the folding of programmable logic arrays
- Bipartite convolution of a programmable logic array.
- Graph folding and programmable logic array
- scientific article; zbMATH DE number 139785 (Why is no real title available?)
- Array Folds Logic
- Algorithmic folding complexity
- Exact algorithms for the maximum k-balanced weighted biclique problem
- A new integer linear programming formulation for the maximum balanced bi-clique problem
- New heuristic approaches for maximum balanced biclique problem
- Suboptimal solution for PLA multiple column folding
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)