Constructing Ramsey graphs from Boolean function representations
type: Item
instance of: scholarly article
title: Constructing Ramsey graphs from Boolean function representations
zbMATH Open document ID: 1349.05230
author: Parikshit Gopalan
published in: Combinatorica
publication date: 2014-08-14T00:00:00Z
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6330536
zbMATH Keywords: Ramsey graphs
zbMATH Keywords: OR function
MaRDI profile type: Publication
full work available at URL: s00493-014-2367-1
OpenAlex ID: W1996712932
cites work: The Shannon capacity of a union
cites work: Representing Boolean functions as polynomials modulo composite numbers
cites work: Set systems with restricted intersections modulo prime powers
cites work: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
cites work: 3-query locally decodable codes of subexponential length
cites work: Some remarks on the theory of graphs
cites work: Intersection theorems with geometric consequences
cites work: Query-efficient algorithms for polynomial interpolation over composites
cites work: A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
cites work: Q4259977
cites work: Q4364578
cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
cites work: Constructing set systems with prescribed intersection sizes
cites work: Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
cites work: A lower bound on the MOD 6 degree of the OR function
cites work: Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $
cites work: Towards 3-query locally decodable codes of subexponential length
DOI: 10.1007/S00493-014-2367-1
description: scientific article; zbMATH DE number 6330536