More on the complexity of slice functions

DOI10.1016/0304-3975(86)90176-3zbMath0597.68043OpenAlexW2001924771MaRDI QIDQ1079365

Ingo Wegener

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90176-3

zbMATH Keywords

Boolean functioncircuit complexitymonotone complexity

Mathematics Subject Classification ID

Related Items (3)

The complexity of central slice functions ⋮ \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice ⋮ On monotone simulations on nonmonotone networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• On the complexity of slice functions
• Lower bounds on monotone complexity of the logical permanent
• Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
• Negation is Powerless for Boolean Slice Functions

This page was built for publication: More on the complexity of slice functions