Communication complexity of matrix computation over finite fields

DOI10.1007/BF01303056MaRDI QIDQ4835864zbMATH OpenFDO

Authors Jeff I. Chu, Georg Schnitger

Publication date 8 June 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01303056

zbMATH Keywords

communication complexitysingularity testing

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The communication complexity of several problems in matrix computation
• Communication complexity theory: thirty-five years of set disjointness
• Randomized communication complexity for linear algebra problems over finite fields
• The computational complexity of some problems of linear algebra (extended abstract)
• scientific article; zbMATH DE number 88975

Cites work

• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• The Area-Time Complexity of Binary Multiplication
• The communication complexity of several problems in matrix computation
• The Fast Fourier Transform in a Finite Field
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Cited in

(4)

• On the complexity of decomposing matrices arising in satellite communication
• The communication complexity of several problems in matrix computation
• Matrix rank and communication complexity
• Randomized communication complexity for linear algebra problems over finite fields

This page was built for publication: Communication complexity of matrix computation over finite fields

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