Pages that link to "Item:Q1233425"

The following pages link to Realizing Boolean functions on disjoint sets of variables (Q1233425):

Displaying 8 items.

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