On Blocky Ranks Of Matrices

DOI10.1007/S00037-024-00248-1MaRDI QIDQ6489336FDOQ6489336

Authors: Amir Yehudayoff 

Publication date: 21 April 2024

Published in: Computational Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

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

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)