Pages that link to "Item:Q2366275"
From MaRDI portal
The following pages link to Threshold circuits of bounded depth (Q2366275):
Displaying 50 items.
- 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)
- Estimation of certain exponential sums arising in complexity theory (Q556911) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Uniqueness of optimal mod 3 polynomials for parity (Q962998) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← 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)
- Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437) (← links)
- Local reduction (Q1641001) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes (Q2150563) (← links)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← 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)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- On the Computational Power of Threshold Circuits with Sparse Activity (Q3421380) (← links)
- Local Reductions (Q3448833) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Testing (Subclasses of) Halfspaces (Q4933385) (← links)
- (Q5009530) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
