[trashtoss]

Seconding the question because I want to see the encodings.

Intuitively this makes sense: in the GA formalism a "single" term requires 2^n fields (where n is the spatial dimension), and "simple" operations like addition and multiplication thus require 2^n (or more) operations to evaluate.

If you could instead somehow do those operations in O(1) time you would clearly pick up a rather nice speedup, but again I'm curious what the problems and encodings (as GA) actually look like.

[trashtoss]

Actually easy to find, for example here: https://members.loria.fr/RSchott/staceyredujanv08.pdf .

[blurbleblurble]

Yup, that's what I was thinking of.