Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028)

From MaRDI portal
Revision as of 11:21, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    24 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references