Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:24, 29 January 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
