Pages that link to "Item:Q2064376"
From MaRDI portal
The following pages link to On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376):
Displaying 14 items.
- About complexity of implementing threshold functions (Q682325) (← links)
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) (Q798294) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Efficient monotone circuits for threshold functions (Q1122560) (← links)
- The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- Simplified Reed-Muller expressions for residue threshold functions (Q1882415) (← links)
- The conjunction complexity asymptotic of self-correcting circuits for monotone symmetric functions with threshold 2 (Q2018031) (← links)
- (Q3364139) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- (Q4301393) (← links)
- A comparison of the computational power of sigmoid and Boolean threshold circuits (Q4839054) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
