Constructing Ramsey graphs from Boolean function representations (Q397068): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-014-2367-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00493-014-2367-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996712932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon capacity of a union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing Boolean functions as polynomials modulo composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems with restricted intersections modulo prime powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-efficient algorithms for polynomial interpolation over composites / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complex-number Fourier technique for lower bounds on the mod-\(m\) degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing set systems with prescribed intersection sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the MOD 6 degree of the OR function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-014-2367-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:22, 9 December 2024

scientific article
Language Label Description Also known as
English
Constructing Ramsey graphs from Boolean function representations
scientific article

    Statements

    Constructing Ramsey graphs from Boolean function representations (English)
    0 references
    0 references
    14 August 2014
    0 references
    Ramsey graphs
    0 references
    OR function
    0 references

    Identifiers