Pages that link to "Item:Q1586354"

The following pages link to Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs (Q1586354):

Displaying 21 items.

• Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
• Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances (Q739060) (← links)
• Invitation to intersection problems for finite sets (Q739389) (← links)
• Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
• On a restricted cross-intersection problem (Q855846) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• The Freiman-Ruzsa theorem over finite fields (Q2451906) (← links)
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
• Co-orthogonal codes (Q2491276) (← links)
• (Q2741465) (← links)
• Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
• Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• Proof of the Kakeya set conjecture over rings of integers modulo square-free N (Q5048441) (← links)
• (Q5090413) (← links)
• (Q5090982) (← 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)
• Set systems with restricted intersections modulo prime powers (Q5940302) (← links)