A note on counting independent terms in asymptotic expressions of computational complexity (Q1686563)
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: A note on counting independent terms in asymptotic expressions of computational complexity |
scientific article; zbMATH DE number 6819067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on counting independent terms in asymptotic expressions of computational complexity |
scientific article; zbMATH DE number 6819067 |
Statements
A note on counting independent terms in asymptotic expressions of computational complexity (English)
0 references
15 December 2017
0 references
analysis of algorithms
0 references
experimental algorithmics and optimization
0 references
computational complexity
0 references
asymptotics
0 references
big-oh notation
0 references
0.7040817737579346
0 references
0.6539728045463562
0 references
