Sorting by pile shuffles on queue-like and stack-like piles can be hard

Documenti analoghi

• Sorting permutations with pile shuffle on queue-like and stack-like piles
  di: Treleaven, Kyle B.
  Pubblicazione: (2025)
• Collision-resistant hash-shuffles on the reals
  di: Barmpalias, George, et al.
  Pubblicazione: (2025)
• The PCP-like Theorem for Sub-linear Time Inapproximability
  di: Ma, Hengzhao, et al.
  Pubblicazione: (2021)
• The Probability Spaces of QuickSort
  di: Nadareishvili, George, et al.
  Pubblicazione: (2025)
• Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
  di: Goubault-Larrecq, Aliénor, et al.
  Pubblicazione: (2025)