6 citations · 18 across the 14 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
Reductions for Frequency-Based Data Mining Problems
Stefan Neumann, Pauli Miettinen
Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational…
cs.DS2017★ 3 cited
Conditional Hardness for Sensitivity Problems
Monika Henzinger, Andrea Lincoln, Stefan Neumann +1
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allow…