The following pages link to (Q4230350):
Displaying 5 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)