Pages that link to "Item:Q1928613"

The following pages link to 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613):

Displaying 21 items.

• Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
• How to extract useful randomness from unreliable sources (Q2055615) (← links)
• Extractors for small zero-fixing sources (Q2095117) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Distinct degrees and homogeneous sets (Q2680569) (← links)
• Local Correlation Breakers and Applications to Three-Source Extractors and Mergers (Q3187171) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Induced Subgraphs With Many Distinct Degrees (Q4601057) (← links)
• Large cliques and independent sets all over the place (Q4992901) (← links)
• Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• (Q5092448) (← links)
• (Q5121891) (← links)
• An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs (Q5126775) (← links)
• Proof of a conjecture on induced subgraphs of Ramsey graphs (Q5240169) (← links)
• (Q5875499) (← links)
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• A bipartite version of the Erdős–McKay conjecture (Q6091053) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
• Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)