All our algorithms are in time at most log of the size of history, which is a double-exponential improvement over Darcs' worst case complexity.
All our algorithms are in time at most log of the size of history, which is a double-exponential improvement over Darcs' worst case complexity.