Index Catalog // ScholarsArchive@OSU

Start Over

Filtering by: Creator Blakemore, Paul R. Academic Affiliation Computer Science Date Unknown

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

Creator:

Cull, Paul and Gerety, Colin

Resource Type:

Technical Report

Full Text:

, (1977). .- r Time Complexity of the Towers of Hanoi Problem Colin Gerety and Paul Cull