On a question of Leiss regarding the Hanoi Tower problem (Q861280): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088164183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Towers of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towers of Hanoi and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the generalised cyclic Towers of Hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pascal's Triangle and the Tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Towers of Hanoi rainbow problem: Coloring the rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi with Forbidden Moves / rank
 
Normal rank

Latest revision as of 12:25, 25 June 2024

scientific article
Language Label Description Also known as
English
On a question of Leiss regarding the Hanoi Tower problem
scientific article

    Statements

    On a question of Leiss regarding the Hanoi Tower problem (English)
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Hanoi Tower problem
    0 references
    graphs
    0 references
    digraph
    0 references
    recurrence equation
    0 references
    0 references