Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
Crossref DOI link: https://doi.org/10.3103/S0027132214030036
Published Online: 2014-07-05
Published Print: 2014-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lozhkin, S. A.
Konovodov, V. A.
Text and Data Mining valid from 2014-05-01