20 citations · 31 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016★ 5 cited
The Complexity of Tensor Rank
Marcus Schaefer, Daniel Stefankovic
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by Hås…
cs.CG2016
Hanani-Tutte for Radial Planarity II
Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer
A drawing of a graph is radial if the vertices of are placed on concentric circles with common center , and edges are drawn radially: every edge inter…