Depth and polynomial equivalence of formulas for closed classes of two- valued logic

DOI10.1007/BF01138320zbMath0635.03004MaRDI QIDQ1097251

A. B. Ugol'nikov

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsmany-valued logicsuperposition of functionscomplexity of representation

Mathematics Subject Classification ID

Related Items (4)

Uniformity of a certain systems of functions of many-valued logic ⋮ On a relation between the depth and complexity of monotone Boolean formulas ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ Certain sufficient conditions of uniformity for systems of functions of many-valued logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Depth and polynomial equivalence of formulas for closed classes of two- valued logic