Constructing Ramsey graphs from Boolean function representations

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 115-128

  Gopalan, Parikshit ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

ALGEBRAIC CONSTRUCTIONS; POLYNOMIAL REPRESENTATIONS; RAMSEY GRAPHS;

GRAPH THEORY;

EID: 33748101395     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.14     Document Type: Conference Paper

References (23)

1. N. Alon. Ramsey graphs cannot be defined by real polynomials. Journal of Graph Theory 14, pages 651-661, 1990.
2. N. Alon. The Shannon capacity of a union. Combinatorica, 18(3):301-310, 1998.
3. th IEEE Conference on Computational Complexity (CCC), 2001.
4. N. Alon, J. Pach, R. Pinchasi, R. Rados, and M. Sharir. Crossing patterns of semi-algebraic sets. Journal of Combinatorial Theory Ser A 111, pages 310-326, 2005.
5. L. Babai and P. Frankl. Linear Algebra Methods in Combinatorics. Preliminary version 2, 1992.
6. L. Babai, P. Frankl, S. Kutin, and D. Stefankovic. Set systems with restricted intersections modulo prime powers. Journal, of Combinatorial Theory, Ser. A, 95(1), 2001.
7. (log n) Ramsey graph. arXiv.org, math.CO/0601651, 2006.
8. th Symposium on Theory of Computing (STOC), 2006.
9. D. A. Barrington, R. Beigel, and S. Rudich. Representing Boolean functions as polynomials modulo composite numbers. Computational Complexity, 4:367-382, 1994.
10. th Annual Symposium on the Foundations of Computer Science (FOCS), 2003.
11. P. Erdos. Some remarks on the theory of graphs. Bulletin of the A. M. S., 53:292-294, 1947.
12. P. Frankl and R. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1:357-368, 1981.
13. P. Gopalan. Constructing Ramsey graphs from Boolean function representations. Electronic Colloqium on Computational Complexity ECCC TR05-143, 2005.
14. P. Gopalan. Query-efficient algorithms for polynomial interpolation over composites. In Proceedings of the ACM-SIAM Symposium on Discrete algorithms (SODA), 2006.
15. F. Green. Complex Fourier technique for lower bounds on the mod-m degree. Computational Complexity, 9:16-38, 2000.
16. V. Grolmusz. On the weak mod m representation of boolean functions. Chicago Journal of Theoretical Computer Science, 2, 1995.
17. V. Grolmusz. Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20(1):71-86, 2000.
18. V. Grolmusz. Constructing set systems with prescribed intersection sizes. Journal of Algorithms, 44(2):321-337, 2002.
19. S. Kutin. Constructing large set systems with given intersection sizes modulo composite numbers. Combinatorics, Probability and Computing, 11(5), 2002.
20. M. Naor. Constructing Ramsey graphs from small probability spaces. Manuscript, available online, 1993.
21. th Annual Symposium on Foundations of Computer Science (FOCS), 1993.
22. G. Tardos and D. Barrington. A lower bound on the mod 6 degree of the OR function. Computational Complexity, 7:99-108, 1998.
23. m. SIAM Journal of Discrete Mathematics, 9:55-62, 1996.