The Complexity of Near-Optimal Programmable Logic Array Folding (Q3796745)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Complexity of Near-Optimal Programmable Logic Array Folding
scientific article

    Statements

    The Complexity of Near-Optimal Programmable Logic Array Folding (English)
    0 references
    0 references
    0 references
    1988
    0 references
    VLSI
    0 references
    programmable logic array
    0 references
    NP-complete
    0 references
    folding
    0 references
    PLA
    0 references
    heuristics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references