Two notes on the complexity of the Towers of Hanoi. I. Is Towers of Hanoi really hard? II. Time complexity of the Towers of Hanoi problem

Technical Report

Analytics

Citeable URL: https://ir.library.oregonstate.edu/concern/technical_reports/dz010z297

Attribute Name	Values
Alternative Title	85-20- 2
Creator	Cull, Paul Gerety, Colin
Resource Type	Technical Report
Academic Affiliation	Computer Science
Series	Technical report (Oregon State University. Department of Computer Science)
Rights Statement	In Copyright
Publisher	Oregon State University. Department of Computer Science
Peer Reviewed	No
Language	English [eng]

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Cull_Gerety_85_20_02.pdf	2023-03-23	Public	Download