Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0220030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039334189 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets |
scientific article |
Statements
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (English)
0 references
25 June 1992
0 references
Berman-Hartmanis conjecture
0 references
polynomial-time hard sets
0 references
sparse sets
0 references
bounded truth-table reduction
0 references
