About the depth of decision trees computing boolean functions

Mikhail Moshkov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

Lower and upper bounds for the depth of decision trees computing Boolean functions are established and Shannon functions of the decision tree depth are determined for closed classes of Boolean functions.

Original languageEnglish (US)
Pages (from-to)203-205
Number of pages3
JournalFundamenta Informaticae
Volume22
Issue number3
DOIs
StatePublished - Jan 1 1995

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'About the depth of decision trees computing boolean functions'. Together they form a unique fingerprint.

Cite this