Exact solution of a minimal recurrence

DOI10.1016/S0020-0190(00)00076-4MaRDI QIDQ294799zbMATHOpenAlexFDO

Authors Keh-Ning Chang, Shi-Chun Tsai

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00076-4

zbMATH Keywords

computational complexityanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fault detection; testing in circuits and networks (94C12) Recurrences (11B37)

Recommendations

• Recurrence relations based on minimization and maximization
• Solution of a Divide-and-Conquer Maximin Recurrence
• Analysis of a Recurrence Arising from a Construction for Nonblocking Networks
• Exact balancing is not always good
• An asymptotic theory for recurrence relations based on minimization and maximization.

Cites work

• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• Multidimensional Divide-and-Conquer Maximin Recurrences
• Solution of a Divide-and-Conquer Maximin Recurrence
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence

Cited in

(4)

• Identities and periodic oscillations of divide-and-conquer recurrences splitting at half
• scientific article; zbMATH DE number 6378818 (Why is no real title available?)
• An exactly solvable self-convolutive recurrence
• The ring of \(k\)-regular sequences. II.

This page was built for publication: Exact solution of a minimal recurrence

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