scientific article; zbMATH DE number 895329

MaRDI QIDQ4883341zbMATH OpenFDO

Authors Yasuichi Horibe

Publication date 16 December 1996

zbMATH Keywords

complexityFibonacci treefinite binary tree

Mathematics Subject Classification ID

Trees (05C05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• scientific article; zbMATH DE number 3961638
• On the Fibonacci numbers of trees
• On the complexity of Fibonacci coding
• scientific article; zbMATH DE number 1408147
• A characterization of Fibonacci trees
• scientific article; zbMATH DE number 15556
• On the computational complexity of the theory of complete binary trees
• On the complexity of algorithms on recursive trees
• On the complexity of computing treelength
• On the Complexity of Computing Treelength

Cited in

(4)

• Searching in trees
• scientific article; zbMATH DE number 3961638 (Why is no real title available?)
• The complexity of Fibonacci-like kneading sequences
• scientific article; zbMATH DE number 2239247 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883341)