Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence

DOI10.1006/JAGM.1996.0839MaRDI QIDQ4339007zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang

Publication date 4 June 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0839

zbMATH Keywords

time complexitydivide-and-conquer algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Solution of a Divide-and-Conquer Maximin Recurrence
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
• Multidimensional Divide-and-Conquer Maximin Recurrences

Cited in

(8)

• On the number of hypercubic bipartitions of an integer
• An asymptotic theory for recurrence relations based on minimization and maximization.
• The optimality of a certain purely recursive dissection for a sequentially n-divisible square
• Multidimensional Divide-and-Conquer Maximin Recurrences
• Exact solution of a minimal recurrence
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
• Solution of a Divide-and-Conquer Maximin Recurrence
• Recurrence relations based on minimization and maximization

This page was built for publication: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339007)