Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778)

From MaRDI portal
Revision as of 20:33, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references