Pages that link to "Item:Q1210330"
From MaRDI portal
The following pages link to Majority gates vs. general weighted threshold gates (Q1210330):
Displaying 50 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- The communication complexity of addition (Q519955) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Geometric arguments yield better bounds for threshold circuits and distributed computing (Q1365681) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437) (← links)
- Local reduction (Q1641001) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063) (← links)
- On weak base hypotheses and their implications for boosting regression and classification (Q1848929) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Monotone Boolean formulas can approximate monotone linear threshold functions (Q1878411) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Local Reductions (Q3448833) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- (Q4612486) (← links)
- (Q4612487) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- (Q5009530) (← links)
- (Q5009542) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Neural networks and complexity theory (Q5096819) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
