10 citations · 10 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for s…
cs.DM2016
A constant-time algorithm for middle levels Gray codes
Torsten Mütze, Jerri Nummenpalo
For any integer a middle levels Gray code is a cyclic listing of all -element and -element subsets of such that any two consecutive subset…