Randomized communication complexity for linear algebra problems over finite fields (Q2904786)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomized communication complexity for linear algebra problems over finite fields |
scientific article; zbMATH DE number 6070926
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized communication complexity for linear algebra problems over finite fields |
scientific article; zbMATH DE number 6070926 |
Statements
23 August 2012
0 references
communication complexity
0 references
streaming
0 references
matrix singularity
0 references
determinant
0 references
Randomized communication complexity for linear algebra problems over finite fields (English)
0 references
