scientific article
From MaRDI portal
Publication:3197333
zbMath0712.68053MaRDI QIDQ3197333
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (3)
Comparing the sizes of nondeterministic branching read-k-times programs ⋮ Algorithms and lower bounds for comparator circuits from shrinkage ⋮ Circuit complexity of linear functions: gate elimination and feeble security
This page was built for publication: