On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem
From MaRDI portal
Publication:5194762
DOI10.1137/1.9781611973204.10zbMath1430.68125OpenAlexW2406657407MaRDI QIDQ5194762
Publication date: 17 September 2019
Published in: 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973204.10
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05)