Simple disjunctive normal forms of Boolean functions with a restricted number of zeros (Q1761058)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6106494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple disjunctive normal forms of Boolean functions with a restricted number of zeros |
scientific article; zbMATH DE number 6106494 |
Statements
Simple disjunctive normal forms of Boolean functions with a restricted number of zeros (English)
0 references
15 November 2012
0 references
From the introduction: ``This paper studies the complexity of disjunctive normal forms (DNFs) of Boolean functions defined by their matrices of zeros. The best available bounds are obtained for the minimum number of conjunctions making up a DNF of a Boolean function with a restricted number of zeros. The results can be used to implement characteristic functions of classes in patterns with binary data.''
0 references
Boolean function
0 references
disjunctive normal form
0 references
complexity
0 references
pattern recognition
0 references
0.8734616041183472
0 references
0.8726663589477539
0 references
0.8546163439750671
0 references
