Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Short Notes: A Fast Algorithm for the Towers of Hanoi Problem

From MaRDI portal
Publication:3799633
Jump to:navigation, search

DOI10.1093/COMJNL/30.4.376zbMath0653.68036OpenAlexW40841079MaRDI QIDQ3799633

Maurice Clint, D. Gault

Publication date: 1987

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/30.4.376



zbMATH Keywords

time complexityTowers of Hanoi


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)







This page was built for publication: Short Notes: A Fast Algorithm for the Towers of Hanoi Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3799633&oldid=17367234"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 15:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki