Some Maximal Solutions of the Generalized Subadditive Inequality
From MaRDI portal
Cites work
- A note on the edges of the n-cube
- scientific article; zbMATH DE number 3127846 (Why is no real title available?)
- scientific article; zbMATH DE number 3456303 (Why is no real title available?)
- scientific article; zbMATH DE number 3481584 (Why is no real title available?)
- scientific article; zbMATH DE number 3583848 (Why is no real title available?)
- scientific article; zbMATH DE number 3637924 (Why is no real title available?)
- scientific article; zbMATH DE number 3196393 (Why is no real title available?)
- scientific article; zbMATH DE number 3073237 (Why is no real title available?)
- Postulates for subadditive processes
- Some Recurrence Relations of Recursive Minimization
- Some Theorems on Sorting
Cited in
(8)- The maximal solution of a restricted subadditive inequality in numerical analysis
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
- A family of restricted subadditive recursions
- Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- Exact solution of a minimal recurrence
- Some Recurrence Relations of Recursive Minimization
This page was built for publication: Some Maximal Solutions of the Generalized Subadditive Inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956954)