The following pages link to Powering requires threshold depth 3 (Q845974):
Displaying 4 items.
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Circuit complexity of powering in fields of odd characteristic (Q3187179) (← links)
- Threshold Circuits for Iterated Matrix Product and Powering (Q4494480) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)