On a question of Leiss regarding the Hanoi Tower problem
type: Item
instance of: scholarly article
title: On a question of Leiss regarding the Hanoi Tower problem
zbMATH Open document ID: 1140.68074
author: N. E. Zubov
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 5083798
zbMATH Keywords: Hanoi Tower problem
zbMATH Keywords: graphs
zbMATH Keywords: digraph
zbMATH Keywords: recurrence equation
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.019
OpenAlex ID: W2088164183
cites work: Developments in Language Theory
cites work: The Towers of Hanoi Problem
cites work: Towers of Hanoi and Analysis of Algorithms
cites work: The complexity of the generalised cyclic Towers of Hanoi problem
cites work: Pascal's Triangle and the Tower of Hanoi
cites work: Q3758856
cites work: Q3222868
cites work: The Towers of Hanoi rainbow problem: Coloring the rings
cites work: The Tower of Hanoi with Forbidden Moves
DOI: 10.1016/J.TCS.2006.09.019
description: scientific article; zbMATH DE number 5083798