scientific article; zbMATH DE number 895329

zbMATH Open0853.05029MaRDI QIDQ4883341FDOQ4883341

Yasuichi Horibe

Publication date: 16 December 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityFibonacci treefinite binary tree

Mathematics Subject Classification ID

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

Cited In (3)

• The complexity of Fibonacci-like kneading sequences
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• On the complexity of computing treelength 👍 👎
• On the Complexity of Computing Treelength 👍 👎
• A characterization of Fibonacci trees 👍 👎
• On the complexity of algorithms on recursive trees 👍 👎
• On the complexity of Fibonacci coding 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)