Towers of Hanoi and Analysis of Algorithms

From MaRDI portal

Revision as of 09:36, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3718506

Jump to:navigation, search

DOI10.2307/2322448zbMath0589.90086OpenAlexW4236343746MaRDI QIDQ3718506

E. F. jun. Ecklund, Paul Cull

Publication date: 1985

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322448

zbMATH Keywords

complexity analysis of algorithms best algorithm Towers of Hanoi problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Mathematical programming (90C99)

Related Items (7)

On a question of Leiss regarding the Hanoi Tower problem ⋮ An iterative algorithm for the Tower of Hanoi with four pegs ⋮ Tours de Hanoï et automates ⋮ A statistical analysis of the towers of hanoi problem ⋮ New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces ⋮ Parallelism for multipeg towers of Hanoi ⋮ Word calculus in the fundamental group of the Menger curve

This page was built for publication: Towers of Hanoi and Analysis of Algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3718506&oldid=17219005"