A general method to construct oracles realizing given relationships between complexity classes
type: Item
instance of: scholarly article
title: A general method to construct oracles realizing given relationships between complexity classes
zbMATH Open document ID: 0871.68080
DOI: 10.1016/0304-3975(95)00161-1
author: Nikolai K. Vereshchagin
author: Andrej Muchnik
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 984413
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00161-1
OpenAlex ID: W1973576061
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: An oracle builder's toolkit
cites work: Q4525727
cites work: Complexity Measures for Public-Key Cryptosystems
cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME
cites work: Relativized Polynomial Time Hierarchies Having Exactly K Levels
cites work: BPP and the polynomial hierarchy
cites work: Relativized Questions Involving Probabilistic Algorithms
cites work: Q3662618
description: scientific article; zbMATH DE number 984413