Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:27, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 |
scientific article |
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
