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 the normal view instead:
scientific article; zbMATH DE number 12898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9223230481147766
0 references
0.8992949724197388
0 references
0.8911082148551941
0 references
0.8898025751113892
0 references
