52 citations · 146 across the 41 of their papers we have counts for
1 paper · 2 filters
Christoph Haase, Stefan Kiefer
We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the literat…