scientific article
From MaRDI portal
Publication:4036708
zbMath0770.94010MaRDI QIDQ4036708
Michael S. Paterson, Uri Zwick, Nicholas J. Pippenger
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
\(\Sigma\Pi\Sigma\) threshold formulas ⋮ Better lower bounds for monotone threshold formulas ⋮ Complexity and depth of formulas for symmetric Boolean functions ⋮ Complexity of computation in finite fields ⋮ A stronger LP bound for formula size lower bounds via clique constraints ⋮ Upper bounds for the formula size of symmetric Boolean functions ⋮ Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ Formula complexity of a linear function in a \(k\)-ary basis ⋮ Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths ⋮ Unnamed Item ⋮ Shallow circuits and concise formulae for multiple addition and multiplication
This page was built for publication:
