Free Bits, PCPs, and Nonapproximability---Towards Tight Results (Q4388899)

From MaRDI portal
Revision as of 16:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1150663
Language Label Description Also known as
English
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
scientific article; zbMATH DE number 1150663

    Statements

    Free Bits, PCPs, and Nonapproximability---Towards Tight Results (English)
    0 references
    0 references
    0 references
    0 references
    10 May 1998
    0 references
    0 references
    intractability
    0 references
    approximation
    0 references
    NP-hardness
    0 references
    probabilistic proof systems
    0 references