2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.CO2019★ 2 cited
An exact algorithm for the minimum rank of a graph
Boris Brimkov, Zachary Scherr
The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this not…
cs.CR2016
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials
Ted Chinburg, Brett Hemenway, Nadia Heninger +1
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic c…