Resolution:
## Figure 4.
Computational complexity of Ternary Dot Product algorithms. Counts of the numbers of D-values computed by the simple quartic algorithm and during the thresholding part
of the 2 × 2- and 3 × 2-family algorithms. Solid lines indicate total counts while
corresponding dotted Lines indicate the numbers of contingency tables (respectively
families) that pass the ϵD_{max }threshold. The left panel shows a "dense" case n_{0 }= 5n_{+ }while the right panel shows a "sparse" case n_{0 }= 50n_{+}. For these examples we set n_{+ }= n_{- }= q_{+ }= q_{- }and chose ϵ = 10^{-16}.
Chindelevitch |