A cache-aware data structure for representing boolean polynomials

The performance of many mathematical and computational tasks highly depends on the implementation of polynomial arithmetic. Motivated by improving the efficiency of the computation of boolean Gröbner bases, we present a cache-aware representation of sparse boolean polynomials. We also present extremely high-performance implementations of the polynomial operations required in classical Gröbner basis algorithms.