Additional file 1: of A fast exact sequential algorithm for the partial digest problem

2016-12-22T05:00:00Z (GMT) by Mostafa Abbas Hazem Bahig
Supplementary figure. Figure F1 a–c represents the behavior of the running time for BBd, BBb, and BBb2 algorithms with different values of M and fixed value of n. The values on the y-axis are in log-scale. In Figure a, the x-axis does not include the value of M = n * 10, because the running time is greater than 24 h. (PDF 8 kb)