Aaron Potechin

activity

20082023

most citedExact tensor completion with sum-of-squares

21 citations · 61 across the 21 of their papers we have counts for

collaborators

Showing 2009Show all

2 papers · 1 filter

cs.CC2009

Bounds on monotone switching networks for directed connectivity

Aaron Potechin

We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on $n$ vertices must have size at least $n^{(} Ω (l g (n)))$ .

math.CO2009★ 5 cited

The critical group of a line graph

Andrew Berget, Andrew Manion, Molly Maxwell +2

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critic…