Bounds on the depth of decision trees that compute Boolean functions

MaRDI QIDQ1385854zbMATH OpenFDO

Authors M. Yu. Moshkov

Publication date 23 June 1998

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

computation of Boolean functionsnondeterministic computationsbounds on the minimal depth of decision treesclosed class of Boolean functionsdeterministic computations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 741345
• Publication:4892375
• scientific article; zbMATH DE number 2237377
• Decision trees with Boolean threshold queries
• scientific article; zbMATH DE number 176776

Cited in

(13)

• scientific article; zbMATH DE number 927106 (Why is no real title available?)
• scientific article; zbMATH DE number 2237377 (Why is no real title available?)
• On boolean decision trees with faulty nodes
• scientific article; zbMATH DE number 426344 (Why is no real title available?)
• On the decision tree depth
• Bounds on depth of decision trees derived from decision rule systems with discrete attributes
• Decision trees with Boolean threshold queries
• scientific article; zbMATH DE number 1810489 (Why is no real title available?)
• scientific article; zbMATH DE number 1179978 (Why is no real title available?)
• A syntactic characterization of bounded-rank decision trees in terms of decision lists
• scientific article; zbMATH DE number 741345 (Why is no real title available?)
• scientific article; zbMATH DE number 176776 (Why is no real title available?)
• scientific article; zbMATH DE number 3976336 (Why is no real title available?)

This page was built for publication: Bounds on the depth of decision trees that compute Boolean functions

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