Complexity and depth of formulas for symmetric Boolean functions
Crossref DOI link: https://doi.org/10.3103/S0027132216030098
Published Online: 2016-07-31
Published Print: 2016-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Sergeev, I. S.
License valid from 2016-05-01