Succinct circuit representations and leaf language classes are basically the same concept (Q671606)

From MaRDI portal
Revision as of 10:00, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Succinct circuit representations and leaf language classes are basically the same concept
scientific article

    Statements

    Succinct circuit representations and leaf language classes are basically the same concept (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    Computational complexity
    0 references
    Leaf language classes
    0 references
    Succinct representations
    0 references
    Polynomial-time many-one completeness
    0 references

    Identifiers