Proving Divide and Conquer Complexities in Isabelle/HOL

The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210, 1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide and Conquer algorithms. This work describes a formalisation of the Akra–Bazzi m...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of automated reasoning Vol. 58; no. 4; pp. 483 - 508
Main Author:	Eberl, Manuel
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.04.2017
Subjects:	Algorithms Artificial Intelligence Automated reasoning Automation Complexity Computer Science Derivation Mathematical Logic and Formal Languages Mathematical Logic and Foundations Symbolic and Algebraic Manipulation Texts Theorem proving Theorems Divide and Conquer algorithms Isabelle/HOL Akra–Bazzi Master Theorem Landau symbols Recurrences Complexity
ISSN:	0168-7433, 1573-0670
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!