An optimal algorithm with unknown time complexity for convex matrix searching (Q917275)

From MaRDI portal
Revision as of 10:54, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An optimal algorithm with unknown time complexity for convex matrix searching
scientific article

    Statements

    An optimal algorithm with unknown time complexity for convex matrix searching (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    design of algorithms
    0 references
    computational complexity
    0 references
    convex matrix searching
    0 references