On a Relation Between the Depth and Complexity of Monotone Boolean Formulas

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of applied and industrial mathematics Ročník 13; číslo 4; s. 746 - 752
Hlavní autor: Sergeev, I. S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.10.2019
Springer Nature B.V
Témata:
Boolean
Boolean algebra
Boolean functions
Complexity
Mathematics
Mathematics and Statistics
complexity
depth
monotone function
Boolean formula
ISSN:1990-4789, 1990-4797
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478919040161