Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets |
scientific article; zbMATH DE number 12898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets |
scientific article; zbMATH DE number 12898 |
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
