NP-hardness of repeated-round Dealer's choice pile shuffle sort
Statement
Let a permutation be given together with positive integers and . In each of rounds, the permutation may be shuffled using Dealer's choice on piles, where the dealer chooses the pile assignment according to the rules of the shuffle. The repeated-round Dealer's choice pile shuffle sort problem asks whether can be sorted in rounds.
NP-hardness conjecture. The repeated-round Dealer's choice pile shuffle sort problem is NP-hard.
The paper states this as an open question motivated by the complexity of sorting permutations in a bounded number of rounds. NP-hardness is established in the forthcoming companion paper for the variable-round version, but the repeated-round case remains unresolved in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.