Pages that link to "Item:Q1166489"

The following pages link to Boolean functions whose monotone complexity is of size \(n^ 2\) / log n (Q1166489):

Displaying 11 items.

• Constructive universal algebra: An introduction (Q579289) (← links)
• On the complexity of slice functions (Q1066866) (← links)
• Lower bounds on monotone complexity of the logical permanent (Q1071001) (← links)
• More on the complexity of slice functions (Q1079365) (← links)
• The complexity of central slice functions (Q1084375) (← links)
• The monotone circuit complexity of Boolean functions (Q1094870) (← links)
• Entropy of contact circuits and lower bounds on their complexity (Q1109754) (← links)
• On monotone simulations on nonmonotone networks (Q1121853) (← links)
• Relating monotone formula size and monotone depth of Boolean functions (Q1835900) (← links)
• Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)
• On Negations in Boolean Networks (Q3644711) (← links)