Deterministic algorithms for skewed matrix products

DOI10.4230/LIPICS.STACS.2013.466MaRDI QIDQ2957908zbMATH OpenFDO

Authors Konstantin Kutzkov

Publication date 30 January 2017

Full work available at URL https://arxiv.org/abs/1209.4508

zbMATH Keywords

approximate deterministic memory-efficient matrix multiplication

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Compressed matrix multiplication
• Compressed matrix multiplication

Cited in

(6)

• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification
• Frequent directions: simple and deterministic matrix sketching
• On nondeterministic derandomization of Freivalds' algorithm: consequences, avenues and algorithmic progress
• Correcting matrix products over the ring of integers
• Multiplication of 0-1 matrices via clustering
• Longest common extensions with wildcards: trade-off and applications

This page was built for publication: Deterministic algorithms for skewed matrix products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957908)