On sparse sets in NP-P (Q1172386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Tally languages and complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inclusion complete tally languages and the Hartmanis-Berman conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Structure of Polynomial Time Reducibility / rank | |||
Normal rank |
Latest revision as of 16:37, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On sparse sets in NP-P |
scientific article |
Statements
On sparse sets in NP-P (English)
0 references
1983
0 references
deterministic and nondeterministic computations
0 references
exptime
0 references
nexptime
0 references
expspace
0 references