Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028)
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: Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 |
scientific article; zbMATH DE number 6418910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 |
scientific article; zbMATH DE number 6418910 |
Statements
Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (English)
0 references
24 March 2015
0 references
0.8311814665794373
0 references
0.8201276659965515
0 references
0.8014355897903442
0 references
0.7969895601272583
0 references
