Pages that link to "Item:Q413295"
From MaRDI portal
The following pages link to Exponential lower bound for bounded depth circuits with few threshold gates (Q413295):
Displaying 17 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Exponential sums and circuits with a single threshold gate and mod-gates (Q1293551) (← links)
- Exponential size lower bounds for some depth three circuits (Q1327392) (← links)
- Approximating threshold circuits by rational functions (Q1333272) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← 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)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q5111162) (← links)
