On the complexity of minimizing quasicyclic Boolean functions (Q4558299)
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: On the complexity of minimizing quasicyclic Boolean functions |
scientific article; zbMATH DE number 6982532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minimizing quasicyclic Boolean functions |
scientific article; zbMATH DE number 6982532 |
Statements
On the Complexity of Minimizing Quasicyclic Boolean Functions (English)
0 references
21 November 2018
0 references
minimization of Boolean functions
0 references
complexity
0 references
extent
0 references
domination
0 references
independent family of sets
0 references
0 references
0.8406016230583191
0 references
0.7909501791000366
0 references
0.7908928990364075
0 references
0.7872210741043091
0 references
0.7812907695770264
0 references
