电邮这篇文章 On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
- 作者: Sergeev I.S.1
-
隶属关系:
- Scientific and Research Institute Kvant
- 期: 卷 13, 编号 4 (2019)
- 页面: 746-752
- 栏目: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213294
- DOI: https://doi.org/10.1134/S1990478919040161
- ID: 213294
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
We present a sequence of monotone Boolean functions whose depth over the basis {∧, ∨} is c > 1.06 times greater than the logarithm of the formula complexity.
作者简介
I. Sergeev
Scientific and Research Institute Kvant
编辑信件的主要联系方式.
Email: isserg@gmail.com
俄罗斯联邦, Chetvyortyi Likhachyovskii per. 15, Moscow, 125438
补充文件
