The (minimum) rank of typical fooling-set matrices

DOI10.1007/978-3-319-58747-9_24zbMath1489.68098arXiv1608.07038OpenAlexW2962679396MaRDI QIDQ2399380

Dirk Oliver Theis, Mozhgan Pourmoradnasseri

Publication date: 22 August 2017

Full work available at URL: https://arxiv.org/abs/1608.07038

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Communication complexity, information complexity (68Q11)

Related Items (2)

On the combinatorial lower bound for the extension complexity of the spanning tree polytope ⋮ Fooling sets and the spanning tree polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Expected values of parameters associated with the minimum rank of a graph
• A comparison of two lower-bound methods for communication complexity
• Combinatorial bounds on nonnegative rank and extended formulations
• Fooling-sets and rank
• On the number of zero-patterns of a sequence of polynomials
• On graphs of minimum skew rank 4
• Introduction to Random Graphs
• The Minrank of Random Graphs
• Communication Complexity
• Fooling-sets and rank in nonzero characteristic (extended abstract)

This page was built for publication: The (minimum) rank of typical fooling-set matrices