Q5875456 (Q5875456): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Near-optimal algorithms for unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a proof of the 2-to-1 games conjecture? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Lower Bounds for Approximating MAX-CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal space lower bound for approximating MAX-CUT / 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: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-optimally expanding sets in Grassmann graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365017 / rank
 
Normal rank

Latest revision as of 11:49, 31 July 2024

scientific article; zbMATH DE number 7650072
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7650072

    Statements

    0 references
    0 references
    3 February 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    communication complexity
    0 references
    CSP
    0 references
    Fourier analysis
    0 references
    lower bounds
    0 references
    streaming algorithms
    0 references
    unique games
    0 references