Bounds on the depth of decision trees that compute Boolean functions (Q1385854)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds on the depth of decision trees that compute Boolean functions |
scientific article; zbMATH DE number 1148050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the depth of decision trees that compute Boolean functions |
scientific article; zbMATH DE number 1148050 |
Statements
Bounds on the depth of decision trees that compute Boolean functions (English)
0 references
23 June 1998
0 references
computation of Boolean functions
0 references
deterministic computations
0 references
nondeterministic computations
0 references
bounds on the minimal depth of decision trees
0 references
closed class of Boolean functions
0 references
