scientific article; zbMATH DE number 139785

zbMATH Open0767.68052MaRDI QIDQ4028110FDOQ4028110

Authors: Claudio Arbib 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• PLA folding in special graph classes
• Graph models for PLA folding problems
• Graph theoretic analysis of PLA folding heuristics
• Compatibility relation algorithm for the folding of programmable logic arrays
• The Complexity of Near-Optimal Programmable Logic Array Folding

zbMATH Keywords

foldingcompatibility graph of a PLA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (8)

• Graph folding and programmable logic array
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of Near-Optimal Programmable Logic Array Folding
• Bipartite convolution of a programmable logic array.
• PLA folding in special graph classes
• Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
• On the orderability problem for PLA folding

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028110)