A Best-First Search Algorithm for Optimal PLA Folding
- 1 July 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 5 (3) , 433-442
- https://doi.org/10.1109/tcad.1986.1270213
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Branch and Bound Algorithm for Optimal PLA FoldingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- An Algorithm for Optimal PLA FoldingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- A Depth-First Branch-and-Bound Algorithm for Optimal PLA FoldingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Techniques for Programmable Logic Array FoldingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976