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

From MaRDI portal
Revision as of 02:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    design of algorithms
    0 references
    computational complexity
    0 references
    convex matrix searching
    0 references

    Identifiers