The following pages link to (Q5670543):
Displaying 5 items.
- Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
- The complexity of the realization of symmetrical functions by formulae (Q1215614) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- Complexity and structure of near-minimal contact circuits for elementary symmetric functions (Q2519400) (← links)
- On implementation of some systems of elementary conjunctions in the class of separating contact circuits (Q2688837) (← links)
