scientific article
From MaRDI portal
Publication:3783554
zbMATH Open0642.68062MaRDI QIDQ3783554
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel machinesPRAMdecision problemthreshold languagecomputational complexity of symmetric functionsprobabilistic lower bounds
Related Items (2)
Approximate inclusion-exclusion for arbitrary symmetric functions ⋮ Tight bounds for the multiplicative complexity of symmetric functions
This page was built for publication: