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)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy (Q1271610) (← 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)
- Local reduction (Q1641001) (← links)
- A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572) (← 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)
- Interactive Information Complexity (Q4592949) (← links)
- (Q4612487) (← links)
- Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)
- A lower bound for monotone perceptrons (Q4841765) (← links)
- (Q5005112) (← links)
- (Q5009555) (← links)
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols (Q5028500) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- (Q5077146) (← links)
- (Q5090432) (← links)
- Neural networks and complexity theory (Q5096819) (← links)
- (Q5121894) (← links)
- On Functions Computed on Trees (Q5214392) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875501) (← links)
- Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums (Q5886829) (← links)
