In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Bohua Zhan, Maximilian P. L. Haslbeck
- ArXiv
- 2018

We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs. We build upon an extension of… (More)

Is this relevant?

2016

2016

- Manuel Eberl
- Journal of Automated Reasoning
- 2016

The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210, 1998. doi: 10.1023/A:1018373005182 ), a generalisation… (More)

Is this relevant?

2016

2016

- Manuel Eberl
- 2016

The Akra–Bazzi method [1], a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of… (More)

Is this relevant?

2016

2016

- Michael A. Bender, Erik D. Demaine, +5 authors Samuel McCauley
- SPAA
- 2016

Memory efficiency and locality have substantial impact on the performance of programs, particularly when operating on large data… (More)

Is this relevant?

2015

2015

- Manuel Eberl
- Archive of Formal Proofs
- 2015

This article contains a formalisation of the Akra–Bazzi method [1] based on a proof by Leighton [2]. It is a generalisation of… (More)

Is this relevant?

2009

2009

- Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani
- APPROX-RANDOM
- 2009

We prove the existence of a poly(n,m)-time computable pseudorandom generator which “1/poly(n,m)-fools” DNFs with n variables and… (More)

Is this relevant?

1996

1996

- Tom Leighton
- 1996

Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year… (More)

Is this relevant?