Pages that link to "Item:Q1193637"
From MaRDI portal
The following pages link to The complexity of computing symmetric functions using threshold circuits (Q1193637):
Displaying 14 items.
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- Approximating threshold circuits by rational functions (Q1333272) (← links)
- \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Threshold circuits detecting global patterns in two-dimensional maps (Q2790159) (← links)
- (Q3360126) (← links)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates (Q3608869) (← links)
- Deterministic restrictions in circuit complexity (Q4228451) (← links)
- A new theorem in threshold logic and its application to multioperand binary adders (Q4467334) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Computational aspects of ideal \((t, n)\)-threshold scheme of Chen, Laing, and Martin (Q6166077) (← links)
