Before revision:  The algorithm operates over the Linear Algebraic Representation (LAR) of argument complexes, i.e., on sparse representation of binary characteristic matrices of d-cell bases, well-suited for implementation in last generation accelerators and GPGPU applications.
After revision:  The algorithm is efficiently implemented using the Linear Algebraic Representation (LAR) of argument complexes, i.e., on sparse representation of binary characteristic matrices of d-cell bases, well-suited for implementation in last generation accelerators and GPGPU applications.