On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
Crossref DOI link: https://doi.org/10.1134/S1990478919040161
Published Online: 2020-02-04
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Sergeev, I. S.
Text and Data Mining valid from 2019-10-01
Version of Record valid from 2019-10-01
Article History
Received: 26 December 2018
Revised: 1 June 2019
Accepted: 5 June 2019
First Online: 4 February 2020