On why an algorithmic time complexity measure can be system invariant rather than system independent (Q2383744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5192436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On why an algorithmic time complexity measure can be system invariant rather than system independent |
scientific article; zbMATH DE number 5192436 |
Statements
On why an algorithmic time complexity measure can be system invariant rather than system independent (English)
0 references
19 September 2007
0 references
Amir Schoor's algorithm
0 references
sparse matrices
0 references
dense matrices
0 references
average case complexity
0 references
big oh
0 references
