Relativizing relativized computations
type: Item
instance of: scholarly article
title: Relativizing relativized computations
zbMATH Open document ID: 0679.68084
DOI: 10.1016/0304-3975(89)90164-3
author: Stephen R. Mahaney
author: Neil Immerman
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4114008
zbMATH Keywords: models of computation
zbMATH Keywords: relativized computations
zbMATH Keywords: oracles
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90164-3
OpenAlex ID: W1969813680
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: A second step toward the polynomial hierarchy
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Q4160434
cites work: On relativized exponential and probabilistic complexity classes
cites work: Q3862379
cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
cites work: Q3662618
cites work: The polynomial-time hierarchy
cites work: Relativized circuit complexity
description: scientific article; zbMATH DE number 4114008