A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Complexity Hierarchy of Shuffles in Card-Based Protocols
A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.