The variable-round dealer's-choice pile shuffle sort problem is NP-hard, shown by reductions from SAT using a new chain-automaton encoding of pile type schedules.
Analysis of casino shelf shuffling machines.The Annals of Applied Probability, 23(4):1692 – 1720, 2013
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Sorting by pile shuffles on queue-like and stack-like piles can be hard
The variable-round dealer's-choice pile shuffle sort problem is NP-hard, shown by reductions from SAT using a new chain-automaton encoding of pile type schedules.