A note on sparse oracles for NP (Q1164997): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4160434 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on Sparse Complete Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A comparison of polynomial time reducibilities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank |
Latest revision as of 14:56, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on sparse oracles for NP |
scientific article |
Statements
A note on sparse oracles for NP (English)
0 references
1982
0 references
polynomial-time hierarchy
0 references
sparse complete sets
0 references