A note on sparse oracles for NP
type: Item
instance of: scholarly article
title: A note on sparse oracles for NP
zbMATH Open document ID: 0486.68033
DOI: 10.1016/0022-0000(82)90050-2
author: Timothy J. Long
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D55
zbMATH DE Number: 3765133
zbMATH Keywords: polynomial-time hierarchy
zbMATH Keywords: sparse complete sets
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90050-2
OpenAlex ID: W2040387487
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Q4160434
cites work: The complexity of theorem-proving procedures
cites work: A Note on Sparse Complete Sets
cites work: Q4142699
cites work: A comparison of polynomial time reducibilities
cites work: The polynomial-time hierarchy
description: scientific article; zbMATH DE number 3765133