Time complexity of the Towers of Hanoi problem
Author:
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. The towers of Hanoi problem
2. [ 2 ] P. Cull E. Ecklund Towers of Hanoi and Analysis of Algorithms American Math Monthly 92(6) (June/July 1985). [2] P. Cull E. Ecklund Towers of Hanoi and Analysis of Algorithms American Math Monthly 92(6) (June/July 1985).
3. [ 4 ] M. Gardner Mathematical Games: The curious properties of the Gray code and how it can be used to solve puzzles Scientific American (August 1972) 106-109. [4] M. Gardner Mathematical Games: The curious properties of the Gray code and how it can be used to solve puzzles Scientific American (August 1972) 106-109.
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Supervised dynamic probabilistic risk assessment: Review and comparison of methods;Reliability Engineering & System Safety;2023-02
2. High dimensional object rearrangement for a robot manipulation in highly dense configurations;Intelligent Service Robotics;2022-09-24
3. Modeling and Simulation of a Tower-of-Hanoi-Playing Robot Station Based on RobotStudio;Advances in Mechanical Design;2022
4. The complexity of an optimal algorithm for the generalized tower of hanoi problem;International Journal of Computer Mathematics;1990-01
5. Tours de Hanoï et automates;RAIRO - Theoretical Informatics and Applications;1990
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3