Some Maximal Solutions of the Generalized Subadditive Inequality

DOI10.1137/0603038zbMath0494.05003OpenAlexW1985286232MaRDI QIDQ3956954

Charles J. K. Batty, Douglas G. Rogers

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603038

zbMATH Keywords

asymptotic behaviorgeneralized subadditive inequalitygeneralized subadditive sequence

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial inequalities (05A20) Sequences and sets (11B99)

Related Items (8)

Some Recurrence Relations of Recursive Minimization ⋮ Exact solution of a minimal recurrence ⋮ The maximal solution of a restricted subadditive inequality in numerical analysis ⋮ Solutions of two minmax recurrences in parallel processing with variable recombination overhead ⋮ 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

Cites Work

• Postulates for subadditive processes
• A note on the edges of the n-cube
• Some Recurrence Relations of Recursive Minimization
• Some Theorems on Sorting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Maximal Solutions of the Generalized Subadditive Inequality