Pages that link to "Item:Q1401173"
From MaRDI portal
The following pages link to An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173):
Displaying 11 items.
- Exact solution of a minimal recurrence (Q294799) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- Asymptotic expansions for dynamic programming recursions with general nonnegative matrices (Q1078098) (← links)
- Recurrence relations based on minimization and maximization (Q1079343) (← links)
- Divide-and-conquer recurrences -- classification of asymptotics (Q1592813) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Nearly subadditive sequences (Q2216925) (← links)
- On the cost of optimal alphabetic code trees with unequal letter costs (Q2472833) (← links)
- A General Framework for Static Cost Analysis of Parallel Logic Programs (Q5097623) (← links)
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half (Q6153612) (← links)
