Pages that link to "Item:Q1273878"
From MaRDI portal
The following pages link to Threshold circuits of small majority-depth (Q1273878):
Displaying 22 items.
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Some notes on threshold circuits, and multiplication in depth 4 (Q1182104) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
- Minimal feedforward parity networks using threshold gates (Q2708445) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- Threshold Circuits for Iterated Matrix Product and Powering (Q4494480) (← links)
- On realizing iterated multiplication by small depth threshold circuits (Q4596612) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Parity helps to compute majority (Q5091774) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)
