4 citations · 13 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.SC2015★ 2 cited
On the robust hardness of Gröbner basis computation
Gwen Spencer, David Rolnick
The computation of Gröbner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robu…
cs.SI2015★ 1 cited
Sticky Seeding in Discrete-Time Reversible-Threshold Networks
Gwen Spencer
When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding b…