The following pages link to (Q4036708):
Displaying 12 items.
- Complexity and depth of formulas for symmetric Boolean functions (Q334301) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Upper bounds for the formula size of symmetric Boolean functions (Q465106) (← links)
- Shallow circuits and concise formulae for multiple addition and multiplication (Q1312182) (← links)
- \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
- Better lower bounds for monotone threshold formulas (Q1356879) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (Q2074348) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- (Q5150372) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
