scientific article
From MaRDI portal
Publication:3345785
zbMath0552.68050MaRDI QIDQ3345785
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic algorithmspolynomial timecomplexity classesprobabilistic oraclesprobabilistic polynomial time hierarchiesrandom quantifier
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)
This page was built for publication: