Bounds on the depth of decision trees that compute Boolean functions
From MaRDI portal
Publication:1385854
zbMATH Open0893.06003MaRDI QIDQ1385854
Publication date: 23 June 1998
Published in: Doklady Mathematics (Search for Journal in Brave)
computation of Boolean functionsnondeterministic computationsbounds on the minimal depth of decision treesclosed class of Boolean functionsdeterministic computations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Boolean functions (06E30)
Related Items (3)
On boolean decision trees with faulty nodes ⋮ A syntactic characterization of bounded-rank decision trees in terms of decision lists ⋮ On the decision tree depth
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)
