Realizing Boolean functions on disjoint sets of variables

DOI10.1016/0304-3975(76)90089-XzbMath0345.94025MaRDI QIDQ1233425

Wolfgang J. Paul

Publication date: 1976

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

Mathematics Subject Classification ID

Related Items (8)

\(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice ⋮ Geometric arguments yield better bounds for threshold circuits and distributed computing ⋮ The choice and agreement problems of a random function ⋮ On the complexity of 2-output Boolean networks ⋮ The direct sum of universal relations ⋮ The communication complexity of enumeration, elimination, and selection ⋮ Minimal polynomials for the conjunction of functions on disjoint variables can be very simple ⋮ Characterization of all optimal networks for a simultaneous computation of AND and NOR

Cites Work

• Complexity of monotone networks for Boolean matrix product
• Monotone switching circuits and Boolean matrix product
• Gaussian elimination is not optimal
• On the computational power of pushdown automata
• Fast multiplication of large numbers
• Berechnung und Programm. I
• Berechnungen in partiellen Algebren endlichen Typs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizing Boolean functions on disjoint sets of variables