Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=6977850

Towers of Hanoi problem with arbitrary k≥3 pegs

Author
LU XUE-MIAO1
[1] Yunnan teachers univ., dep. mathematics, Kunming, China
Source

International journal of computer mathematics. 1988, Vol 24, Num 1, pp 39-54 ; ref : 8 ref

CODEN
IJCMAT
ISSN
0020-7160
Scientific domain
Computer science; Mathematics
Publisher
Taylor and Francis, Abingdon
Publication country
United Kingdom
Document type
Article
Language
English
Keyword (fr)
Analyse algorithme Combinatoire Formule récurrence Permutation Problème combinatoire
Keyword (en)
Algorithm analysis Combinatorics Recurrence formula Permutation Combinatory problem
Keyword (es)
Análisis algoritmo Combinatoria Fórmula recurrente Permutación Problema combinatorio
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01A Classical combinatorial problems

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
6977850

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web