On the orderability problem for PLA folding

DOI10.1016/0166-218X(89)90010-3zbMath0682.68080OpenAlexW2095238613MaRDI QIDQ1824403

S. S. Ravi

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90010-3

zbMATH Keywords

NP- completebipartite foldingorderability problemprogrammable logic array (PLA) folding

Mathematics Subject Classification ID

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

Related Items (1)

Graph theoretic analysis of PLA folding heuristics

Cites Work

• Parallel concepts in graph theory
• The Complexity of Near-Optimal Programmable Logic Array Folding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the orderability problem for PLA folding