24 citations · 33 across the 2 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
On Counting Perfect Matchings in General Graphs
Daniel Štefankovič, Eric Vigoda, John Wilmes
Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute ex…
cs.LG2017★ 24 cited
On the Complexity of Learning Neural Networks
Le Song, Santosh Vempala, John Wilmes +1
The stunning empirical successes of neural networks currently lack rigorous theoretical explanation. What form would such an explanation take, in the face of existing complexity-th…