603 citations · 1.6k across the 72 of their papers we have counts for
1 paper · 2 filters
Alexander Golovnev, Oded Regev, Omri Weinstein
The minrank of a graph G is the minimum rank of a matrix M that can be obtained from the adjacency matrix of G by switching some ones to zeros (i.e., deleting edges) and then…