We study the problem of efficiently correcting an erroneous product of two n×nn×n matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most k erroneous entries running in O~(n2+kn)O~(n2+kn) time and a deterministic O~(kn2)O~(kn2)-time algorithm for this problem (where the notation O~O~suppresses polylogarithmic terms in n and k)
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of s...
Until a few years ago, the fastest known matrix multiplication algorithm, due to Copper-smith and Wi...
We study the problem of efficiently correcting an erroneous product of two n x n matrices over a rin...
Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained r...
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed ...
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed ...
Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued ...
Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained r...
Discussion of the computation of matrix chain products of the form M//1 multiplied by M//2 multiplie...
By combining Kaltofen's 1992 baby steps/giant steps technique for Wiedemann's 1986 determinant algor...
We present a simple algorithm that approximates the product of n-by-n real matrices A and B. Let ||A...
AbstractThe main purpose of this paper is to present a fast matrix multiplication algorithm taken fr...
A Las Vegas type probabilistic algorithm is presented for finding the Frobenius canonical form of an...
Abstract. Rounding a real-valued matrix to an integer one such that the rounding errors in all rows ...
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of s...
Until a few years ago, the fastest known matrix multiplication algorithm, due to Copper-smith and Wi...
We study the problem of efficiently correcting an erroneous product of two n x n matrices over a rin...
Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained r...
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed ...
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed ...
Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued ...
Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained r...
Discussion of the computation of matrix chain products of the form M//1 multiplied by M//2 multiplie...
By combining Kaltofen's 1992 baby steps/giant steps technique for Wiedemann's 1986 determinant algor...
We present a simple algorithm that approximates the product of n-by-n real matrices A and B. Let ||A...
AbstractThe main purpose of this paper is to present a fast matrix multiplication algorithm taken fr...
A Las Vegas type probabilistic algorithm is presented for finding the Frobenius canonical form of an...
Abstract. Rounding a real-valued matrix to an integer one such that the rounding errors in all rows ...
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of s...
Until a few years ago, the fastest known matrix multiplication algorithm, due to Copper-smith and Wi...