Pages that link to "Item:Q685717"
From MaRDI portal
The following pages link to On the power of small-depth threshold circuits (Q685717):
Displaying 50 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Energy and fan-in of logic circuits computing symmetric Boolean functions (Q393138) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Majority gates vs. general weighted threshold gates (Q1210330) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- Approximating threshold circuits by rational functions (Q1333272) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- A slight sharpening of LMN (Q1604204) (← links)
- Local reduction (Q1641001) (← links)
- A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- Energy and Fan-In of Threshold Circuits Computing Mod Functions (Q3010397) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- DECISION TREES DO NOT GENERALIZE TO NEW VARIATIONS (Q3224352) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Local Reductions (Q3448833) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- Deep Belief Networks Are Compact Universal Approximators (Q3583502) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
- On the Power of Threshold Circuits with Small Weights (Q3979443) (← links)
- Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- On realizing iterated multiplication by small depth threshold circuits (Q4596612) (← links)
- (Q4612487) (← links)
- Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)
- A comparison of the computational power of sigmoid and Boolean threshold circuits (Q4839054) (← links)
