Login / Signup

A Linear Algorithm for Copying Binary Trees Using Bounded Workspace.

K. P. Lee
Published in: Commun. ACM (1980)
Keyphrases
  • binary trees
  • np hard
  • optimal solution
  • computational complexity
  • objective function
  • search space
  • bayesian networks
  • temporal reasoning
  • space complexity