Closed AtticusKuhn closed 1 year ago
In this PR, I defined parallelCost, which gives the cost of any algorithm in a closed Cartesian category. I then proved that a reduction of a tree with height n takes n time.
parallelCost
n
This PR is related to https://github.com/AtticusKuhn/parallel-algorithms/issues/1#issuecomment-1558388234
In this PR, I defined
parallelCost
, which gives the cost of any algorithm in a closed Cartesian category. I then proved that a reduction of a tree with heightn
takesn
time.