“…In particular, Sparse presents a steep quadratic growth both in time and space, our proposed method peroforms almost linearly. Total degrees: (0, 1), (2, 0), (2, 1), (2, 2), (3, 2) (4, 2), (3,4), (5,3), (3,6) Total degrees: (0, 0, 1), (1, 0, 1), (0, 1, 2), (1, 2, 1), (0, 3, 2), (2, 2, 2) (3, 2, 2), (3, 4, 1), (5, 3, 1), (2,3,5) Total degrees: (0, 1), (2, 0), (2, 1), (2, 2), (3, 2) (4, 2), (3,4), (5,3), (3,6), (6,4) Allocation (bytes) sin xe y Total degrees: (0, 0, 1), (1, 0, 1), (0, 1, 2), (1, 2, 1), (0, 3, 2), (2, 2, 2) (3, 2, 2), (3, 4, 1), (5,3,1), (2,3,5), (5,4,2), (3,4,5) Allocation (bytes) sin xe y 2 +z Sparse diffs our method In summary, our method performs really well both in terms of time and space in the multivariate case, although we need more optimisation in univariate cases.…”