Time complexity of the Towers of Hanoi problem
Cainen Gerety, Paul Cull · ACM SIGACT News · 1986
article Free Access Share on Time complexity of the Towers of Hanoi problem Authors: C Gerety View Profile , P Cull View Profile Authors Info & Claims ACM SIGACT NewsVolume 18Issue 1Summer 1986 pp 80–87https://doi.org/10.1145/8312.8320Published:01 March 1986Publication History 9citation2,018DownloadsMetricsTotal Citations9Total Downloads2,018Last 12 Months318Last 6 weeks76 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF