Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n log n)$ words

(https://pubmed-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/24626234/)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2014

Reference

https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pubmed/24626234

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Probabilistic_Convolution_Tree_(Change-Making_Problem_Change-Making_Problem)&oldid=47362"