Created
June 21, 2021 16:01
-
-
Save IvanVergiliev/3a444b7fd597fe97cca2d913237b30f2 to your computer and use it in GitHub Desktop.
Exponential Tree Transformation Complexity
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
f(H) = | |
f(H - 1) // for the first transform call | |
+ | |
f(H - 1) // for the second transform call | |
= 2 * f(H - 1) = | |
= 2 * 2 * f(H - 2) = ... = 2 ^ (H - 1) * f(1) // unfolding further |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment