Pages that link to "Item:Q397068"

The following pages link to Constructing Ramsey graphs from Boolean function representations (Q397068):

Displaying 8 items.

• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← 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)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• On the modulo degree complexity of Boolean functions (Q5918108) (← links)
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)