An optimal algorithm with unknown time complexity for convex matrix searching (Q917275): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:10, 30 January 2024
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
