ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic reduction of the level of randomness in some probabilistic geometric constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling convex bodies: a random matrix approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimension of almost spherical sections of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the norm of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy numbers of diagonal operators between symmetric Banach spaces / rank
 
Normal rank

Latest revision as of 16:43, 28 June 2024

scientific article
Language Label Description Also known as
English
ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS
scientific article

    Statements

    Identifiers

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