scientific article; zbMATH DE number 3885883

From MaRDI portal
Publication:3220570





[For the entire collection see Zbl 0544.00005.] The author defines the two notions of positive and negative relativization of complexity classes. He surveys work done on both notions, with particular reference to relativized computation in the presence of bounds on the amount of nondeterminism, and/or the number of oracle queries available, with no other restrictions on computational resources. Some general comments are included concerning the goals of computational complexity theory.




Cited in
(27)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220570)