Grammar-Compressed Square-Matrix-Vector Multiplication

Given an N×NN\times N matrix, where each row is compressed to size nNn\ll N, and an NN-dimensional vector that is grammar-compressed to size nn, compute their the matrix-vector product.

Parameters

  • NN: dimension of original vector (and one dimension of matrix)
  • nn: dimension of grammar-compressed vector

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table