The complexity of the realization of symmetrical functions by formulae

DOI10.1007/BF01366920zbMath0301.02016MaRDI QIDQ1215614

V. M. Khrapchenko

Publication date: 1972

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

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (5)

\(\Sigma\Pi\Sigma\) threshold formulas ⋮ Complexity and depth of formulas for symmetric Boolean functions ⋮ Upper bounds for the formula size of symmetric Boolean functions ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ The Orthogonal Vectors Conjecture for Branching Programs and Formulas

Cites Work

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

This page was built for publication: The complexity of the realization of symmetrical functions by formulae