Pages that link to "Item:Q314174"
From MaRDI portal
The following pages link to Circuit complexity of symmetric Boolean functions in antichain basis (Q314174):
Displaying 8 items.
- Circuit complexity of symmetric Boolean functions in antichain basis (Q314174) (← links)
- Lower estimates of circuit complexity in the basis of antichain functions (Q355314) (← links)
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in (Q2131416) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- (Q4301458) (← links)
- On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643) (← links)