Pages that link to "Item:Q1585523"
From MaRDI portal
The following pages link to A statistical analysis of an algorithm's complexity (Q1585523):
Displaying 8 items.
- A mixed evolutionary-statistical analysis of an algorithm's complexity (Q1861853) (← links)
- Can statistics provide a realistic measure for an algorithm's complexity? (Q1961733) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A simple empirical formula for categorizing computing operations (Q2381324) (← links)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← links)
- Winograd's algorithm statistically revisited: it pays to weigh than to count! (Q2383729) (← links)
- Software complexity: a statistical case study through insertion sort (Q2383731) (← links)
- On why an algorithmic time complexity measure can be system invariant rather than system independent (Q2383744) (← links)
