45 citations · 119 across the 21 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Dense graphs have rigid parts
Orit E. Raz, József Solymosi
While the problem of determining whether an embedding of a graph in is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G…
cs.CC2019
Subspace arrangements, graph rigidity and derandomization through submodular optimization
Orit E. Raz, Avi Wigderson
This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field).…