Deciding Representability of Sets of Words of Equal Length in Polynomial Time (Q2870014)

From MaRDI portal
Revision as of 19:38, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deciding Representability of Sets of Words of Equal Length in Polynomial Time
scientific article

    Statements

    Deciding Representability of Sets of Words of Equal Length in Polynomial Time (English)
    0 references
    17 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references