2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4007/annals.2012.176.3.3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160212276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon capacity of a union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Randomness Using Few Independent Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum-product estimate in finite fields, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Ramsey graphs from Boolean function representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank co-diagonal matrices and Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better extractors for better codes? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On data structures and asymmetric communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors with weak random seeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting all the randomness and reducing the error in Trevisan's extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Randomness via Repeated Condensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating quasi-random sequences from semi-random sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractor Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders that beat the eigenvalue bound: Explicit construction and applications / rank
 
Normal rank

Latest revision as of 01:07, 6 July 2024

scientific article
Language Label Description Also known as
English
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
scientific article

    Statements

    2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    dispersers
    0 references
    extractors
    0 references
    Ramsey graphs
    0 references

    Identifiers