Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. C. Arbib, M. Lucertini, S. Nicoloso (1990): "Polynomial and NP-complete problems in Programmed Logic Arrays Folding", CNR, Istituto di Analisi dei Sistemi e Informatica, R. 284., January 1990.
2. D.D. Caviglia, V. Piuri, M. Santomauro (1987): "About Folded-PLA Area and Folding Evaluation", Integration, 5, pp. 193–215.
3. G. De Micheli, M. Santomauro (1983): "Topological Partitioning of Programmable Logic Arrays", Int. Conf. on Computer Aided Design.
4. N. Deo, M.S. Krishnamoorthy, M.A. Langston (1987): "Exact and Approximate Solutions for the Gate Matrix Layout Problem", IEEE Trans. on Computer-Aided-Design, CAD-6, 1, pp.79–84.
5. J.R. Egan, C.L. Liu (1984): "Bipartite Folding and Partitioning of a PLA", IEEE Trans. on Computer-Aided-Design, CAD-3, 3, pp. 191–199.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献