Can statistics provide a realistic measure for an algorithm's complexity? (Q1961733): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A statistical analysis of an algorithm's complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4864242 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5540945 / rank | |||
Normal rank | |||
Latest revision as of 12:26, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can statistics provide a realistic measure for an algorithm's complexity? |
scientific article |
Statements
Can statistics provide a realistic measure for an algorithm's complexity? (English)
0 references
13 July 2000
0 references
