An optimal algorithm with unknown time complexity for convex matrix searching (Q917275)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm with unknown time complexity for convex matrix searching |
scientific article; zbMATH DE number 4155868
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm with unknown time complexity for convex matrix searching |
scientific article; zbMATH DE number 4155868 |
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
