Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127495031, #quickstatements; #temporary_batch_1722360600149
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2960354271 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.06156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parallel approximation of a class of integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of multivariate polynomials and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration and Moment Inequalities for Polynomials of Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic derandomization via complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concentration of multivariate polynomials with small expectation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of non‐Lipschitz functions and applications / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127495031 / rank
 
Normal rank

Latest revision as of 18:44, 30 July 2024

scientific article; zbMATH DE number 7136435
Language Label Description Also known as
English
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
scientific article; zbMATH DE number 7136435

    Statements

    Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (English)
    0 references
    0 references
    25 November 2019
    0 references
    concentration bounds
    0 references
    MIS
    0 references
    hypergraph
    0 references
    maximal independent set
    0 references

    Identifiers

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