Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
From MaRDI portal
Publication:1586354
DOI10.1007/s004930070032zbMath0949.05083OpenAlexW2069582894MaRDI QIDQ1586354
Publication date: 13 November 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070032
Analysis of algorithms and problem complexity (68Q25) Extremal set theory (05D05) Ramsey theory (05D10)
Related Items (21)
Proof of the Kakeya set conjecture over rings of integers modulo square-free N ⋮ Pairs of codes with prescribed Hamming distances and coincidences ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ On a restricted cross-intersection problem ⋮ Unnamed Item ⋮ Constructing Ramsey graphs from Boolean function representations ⋮ Query-efficient locally decodable codes of subexponential length ⋮ The Freiman-Ruzsa theorem over finite fields ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Locally Decodable Codes: A Brief Survey ⋮ An Introduction to Randomness Extractors ⋮ Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols ⋮ Set systems with restricted intersections modulo prime powers ⋮ Co-orthogonal codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the modulo degree complexity of Boolean functions ⋮ Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances ⋮ Invitation to intersection problems for finite sets ⋮ Robust characterizations of k -wise independence over product spaces and related testing results ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
This page was built for publication: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
