FAQ

Akra–Bazzi method

Known as: Akra-Bazzi Method, Akra-Bazzi Theorem, Akra–Bazzi theorem 
In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2018
0119962018

Related topics

Related topics

7 relations
AlgorithmComputer scienceMaster theoremMedian of medians
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Akra–Bazzi method
Algorithm
Computer science
Run time (program lifecycle phase)
Recurrence relation
Merge sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
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
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… (More)
  • figure 1
  • table 2
Is this relevant?
2016
2016
Proving Divide & Conquer Complexities in Isabelle/HOL
The Akra–Bazzi method [1], a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of… (More)
  • table 1
  • table 2
Is this relevant?
2016
2016
Cache-Adaptive Analysis
Memory efficiency and locality have substantial impact on the performance of programs, particularly when operating on large data… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
The Akra-Bazzi theorem and the Master theorem
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
Improved Pseudorandom Generators for Depth 2 Circuits
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)
  • figure 1
Is this relevant?
1996
1996
Notes on Better Master Theorems for Divide-and-Conquer Recurrences
Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year… (More)
Is this relevant?