Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs (Q3748965)
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: Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs |
scientific article; zbMATH DE number 3985120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs |
scientific article; zbMATH DE number 3985120 |
Statements
Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs (English)
0 references
1987
0 references
complement of logical expression
0 references
disjunctive normal form
0 references
minimization of logical expressions
0 references
multiple-valued logic
0 references
Boolean functions
0 references
recursive algorithm
0 references
0.8607999682426453
0 references
0.8263540863990784
0 references
0.7627222537994385
0 references
