Communication complexity of matrix computation over finite fields

DOI10.1007/BF01303056zbMath0827.68056MaRDI QIDQ4835864

Jeff I. Chu, Georg Schnitger

Publication date: 8 June 1995

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

zbMATH Keywords

communication complexitysingularity testing

Mathematics Subject Classification ID

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

Cites Work

• The communication complexity of several problems in matrix computation
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• The Area-Time Complexity of Binary Multiplication
• The Fast Fourier Transform in a Finite Field
• Unnamed Item

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