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 the normal view instead:
scientific article; zbMATH DE number 6070926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8360745906829834
0 references
0.8178057670593262
0 references
0.8058809638023376
0 references
0.7964627146720886
0 references
