scientific article
From MaRDI portal
Publication:3359756
zbMath0733.68032MaRDI QIDQ3359756
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Geometric arguments yield better bounds for threshold circuits and distributed computing ⋮ Separating counting communication complexity classes ⋮ Problems complete for \(\oplus L\) ⋮ On the descriptive and algorithmic power of parity ordered binary decision diagrams