Communication complexity of matrix computation over finite fields (Q4835864): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Georg Schnitger / rank | |||
Property / author | |||
Property / author: Georg Schnitger / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Area-Time Complexity of Binary Multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The communication complexity of several problems in matrix computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fast Fourier Transform in a Finite Field / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5553682 / rank | |||
Normal rank |
Latest revision as of 14:47, 23 May 2024
scientific article; zbMATH DE number 762012
Language | Label | Description | Also known as |
---|---|---|---|
English | Communication complexity of matrix computation over finite fields |
scientific article; zbMATH DE number 762012 |
Statements
Communication complexity of matrix computation over finite fields (English)
0 references
8 June 1995
0 references
communication complexity
0 references
singularity testing
0 references
0 references