scientific article
DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200105)47:2<249::AID-MALQ249>3.0.CO;2-N" /><249::AID-MALQ249>3.0.CO;2-N 10.1002/1521-3870(200105)47:2<249::AID-MALQ249>3.0.CO;2-NzbMath0999.03036MaRDI QIDQ2720330
Publication date: 28 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random oraclesresource-bounded reducibilitiesalmost classesgeneralized reducibilitiesmeasurable classes of sets
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (1)
This page was built for publication: