PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making the Long Code Shorter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistic checkable proofs and applications to approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Testing of Reed-Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equality constraint languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCP characterizations of NP: toward a polynomially-small error-probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCPs via the low-degree long code and hardness for constrained hypergraph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of 3-uniform hypergraph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximate Hypergraph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-Hardness of Max-Not-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PRG for lipschitz functions of polynomials with applications to sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for approximate hypergraph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise stability of functions with low influences: invariance and optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover / rank
 
Normal rank

Latest revision as of 01:35, 11 July 2024

scientific article
Language Label Description Also known as
English
PCPs via the low-degree long code and hardness for constrained hypergraph coloring
scientific article

    Statements

    PCPs via the low-degree long code and hardness for constrained hypergraph coloring (English)
    0 references
    0 references
    0 references
    16 November 2015
    0 references
    0 references

    Identifiers

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