Randomized communication complexity for linear algebra problems over finite fields

DOI10.4230/LIPICS.STACS.2012.477MaRDI QIDQ2904786zbMATH OpenFDO

Authors Xiaoming Sun, Chengu Wang

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2012.477

zbMATH Keywords

determinantcommunication complexitystreamingmatrix singularity

Mathematics Subject Classification ID

Randomized algorithms (68W20) Information theory (general) (94A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Determinants, permanents, traces, other special matrix functions (15A15)

Recommendations

• Communication complexity of matrix computation over finite fields
• On the communication complexity of distributed algebraic computation
• The communication complexity of several problems in matrix computation
• Complexity Lower Bounds using Linear Algebra
• scientific article; zbMATH DE number 1769898

Cited in

(6)

• scientific article; zbMATH DE number 7250148 (Why is no real title available?)
• Approximate F₂-Sketching of Valuation Functions
• Quantum communication complexity of linear regression
• Communication complexity of matrix computation over finite fields
• scientific article; zbMATH DE number 5972643 (Why is no real title available?)
• scientific article; zbMATH DE number 1760022 (Why is no real title available?)

This page was built for publication: Randomized communication complexity for linear algebra problems over finite fields

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