A quadratic lower bound for topswops

DOI10.1016/j.tcs.2010.08.011zbMath1238.05005OpenAlexW2074029887WikidataQ60692286 ScholiaQ60692286MaRDI QIDQ410720

Linda Morales, Hal Sudborough

Publication date: 3 April 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.011

zbMATH Keywords

permutationslower boundsconway card gamespancake problemprefix reversalsreverse card shuffletopswops

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items

Physical zero-knowledge proof protocol for Topswops

Uses Software

• OEIS

Cites Work

• An \((18/11)n\) upper bound for sorting by prefix reversals
• Bounds for sorting by prefix reversal
• On the problem of sorting burnt pancakes
• On the Diameter of the Pancake Network
• Sorting by Placement and Shift
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item