Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580)

From MaRDI portal
Revision as of 11:28, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
scientific article

    Statements

    Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (English)
    0 references
    0 references
    0 references
    5 January 2004
    0 references
    0 references
    Cartesian product
    0 references
    Satisfiability problem
    0 references
    Average running time
    0 references
    0 references