scientific article
From MaRDI portal
Publication:3775483
zbMath0635.94025MaRDI QIDQ3775483
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
symmetric Boolean functionsefficient computationbounded depth circuitsmodels of computationcounting functionsparallel random access machines
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Upper bounds on the multiplicative complexity of symmetric Boolean functions ⋮ Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
This page was built for publication:
