On Blocky Ranks Of Matrices

DOI10.1007/S00037-024-00248-1MaRDI QIDQ6489336zbMATH OpenFDO

Authors Amir Yehudayoff

Publication date 21 April 2024

Published in Computational Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication complexity, information complexity (68Q11)

Recommendations

• The binary rank of circulant block matrices
• Rank formulas for certain products of matrices
• The cyclic rank completion problem with regular blocks
• Linear algebraic methods in communication complexity
• Ranks of permutative matrices

Cites work

• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 773997 (Why is no real title available?)
• scientific article; zbMATH DE number 7250146 (Why is no real title available?)
• Approximating threshold circuits by rational functions
• Clique coverings of the edges of a random graph
• Covering the edges of a random graph by cliques
• Dimension-free bounds and structural results in communication complexity
• On Graph Complexity
• On a clique covering problem of Orlin
• On the Addressing Problem for Loop Switching
• On the size of depth-two threshold circuits for the inner product mod 2 function
• Some combinatorial-algebraic problems from complexity theory
• Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
• The Representation of a Graph by Set Intersections
• The main triangle projection in matrix spaces and its applications
• Threshold circuits of bounded depth

This page was built for publication: On Blocky Ranks Of Matrices

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