35 citations · 169 across the 13 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015★ 3 cited
The Complexity of the Kth Largest Subset Problem and Related Problems
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…
cs.CC2014★ 4 cited
The Odds of Staying on Budget
Christoph Haase, Stefan Kiefer
Given Markov chains and Markov decision processes (MDPs) whose transitions are labelled with non-negative integer costs, we study the computational complexity of deciding whether t…