Guest column: additive combinatorics and theoretical computer science
暂无分享,去创建一个
[1] Roy Meshulam,et al. On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions , 1995, J. Comb. Theory, Ser. A.
[2] Dana Ron,et al. Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[3] Shachar Lovett,et al. Inverse conjecture for the gowers norm is false , 2007, Theory Comput..
[4] Vojtech Rödl,et al. Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.
[5] Terence Tao,et al. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle , 2008, 0810.5527.
[6] Avi Wigderson,et al. Kakeya Sets, New Mergers and Old Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[7] W. T. Gowers,et al. Decompositions, approximate structure, transference, and the Hahn–Banach theorem , 2008, 0811.3103.
[8] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[9] W. T. Gowers,et al. A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .
[10] E. Szemerédi. On sets of integers containing no four elements in arithmetic progression , 1969 .
[11] László Lovász,et al. Limits of dense graph sequences , 2004, J. Comb. Theory B.
[12] Saharon Shelah,et al. Primitive recursive bounds for van der Waerden numbers , 1988 .
[13] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[14] Terence Tao,et al. From rotating needles to stability of waves; emerging connections between combinatorics, analysis and PDE , 2000 .
[15] Noga Alon,et al. Every monotone graph property is testable , 2005, STOC '05.
[16] S.V.Konyagin. A sum-product estimate in fields of prime order , 2003, math/0304217.
[17] Ben Green,et al. An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement) , 2010, 1009.3998.
[18] T. Tao,et al. The primes contain arbitrarily long polynomial progressions , 2006, math/0610050.
[19] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[20] Alan M. Frieze,et al. A Simple Algorithm for Constructing Szemere'di's Regularity Partition , 1999, Electron. J. Comb..
[21] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .
[22] Terence Tao,et al. The dichotomy between structure and randomness, arithmetic progressions, and the primes , 2005, math/0512114.
[23] T. Tao,et al. The Mobius function is strongly orthogonal to nilsequences , 2008, 0807.1736.
[24] Jean Bourgain,et al. On Triples in Arithmetic Progression , 1999 .
[25] T. Tao,et al. The primes contain arbitrarily long arithmetic progressions , 2004, math/0404188.
[26] Avi Wigderson,et al. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.
[27] D. R. Heath-Brown. Integer Sets Containing No Arithmetic Progressions , 1987 .
[28] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[29] W. T. Gowers,et al. Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.
[30] Terence Tao. Szemerédi's regularity lemma revisited , 2006, Contributions Discret. Math..
[31] Ben Green,et al. QUADRATIC UNIFORMITY OF THE MOBIUS FUNCTION , 2006, math/0606087.
[32] Terence Tao,et al. Additive combinatorics , 2007, Cambridge studies in advanced mathematics.
[33] Spyridon Antonakopoulos,et al. Buy-at-Bulk Network Design with Protection , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[34] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[35] Emanuele Viola,et al. Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[36] Avi Wigderson,et al. Extracting Randomness Using Few Independent Sources , 2006, SIAM J. Comput..
[37] Noga Alon,et al. Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[38] David Zuckerman,et al. General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[39] Ben Green,et al. AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.
[40] Thomas Holenstein,et al. Key agreement from weak bit agreement , 2005, STOC '05.
[41] Alan M. Frieze,et al. Quick Approximation to Matrices and Applications , 1999, Comb..
[42] Emanuele Viola,et al. The Sum of D Small-Bias Generators Fools Polynomials of Degree D , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[43] J. Bourgain,et al. MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS , 2005 .
[44] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.
[45] Ran Raz,et al. The BNS-Chung criterion for multi-party communication complexity , 2000, computational complexity.
[46] Ben Green,et al. Finite field models in additive combinatories , 2004, BCC.
[47] Luca Trevisan,et al. Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.
[48] Emanuele Viola,et al. Selected Results in Additive Combinatorics: An Exposition , 2007, Theory Comput..
[49] Madhur Tulsiani,et al. Dense Subsets of Pseudorandom Sets , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[50] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[51] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..
[52] Joel Spencer. Shelah Saharon. Primitive recursive bounds for van der Waerden numbers. Journal of the American Mathematical Society , vol. 1 (1988), pp. 683–697. , 1990 .
[53] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[54] Vojtech Rödl,et al. The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.
[55] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, Comb..
[56] Terence Tao,et al. A sum-product estimate in finite fields, and applications , 2003, math/0301343.
[57] Ben Green,et al. The distribution of polynomials over finite fields, with applications to the Gowers norms , 2007, Contributions Discret. Math..
[58] Shachar Lovett,et al. Unconditional pseudorandom generators for low degree polynomials , 2008, Theory Comput..
[59] Ben Green,et al. A NOTE ON THE FREIMAN AND BALOG–SZEMERÉDI–GOWERS THEOREMS IN FINITE FIELDS , 2007, Journal of the Australian Mathematical Society.
[60] F. Behrend. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.
[61] Ben Green,et al. Linear equations in primes , 2006, math/0606088.
[62] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[63] Ben Green,et al. Montreal Lecture Notes on Quadratic Fourier Analysis , 2006 .
[64] K. F. Roth. On Certain Sets of Integers , 1953 .
[65] Vojtech Rödl,et al. The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[66] Thomas Wolff,et al. Recent work connected with the Kakeya problem , 2007 .
[67] Terence Tao,et al. Structure and Randomness in Combinatorics , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[68] W. T. Gowers,et al. The true complexity of a system of linear equations , 2007, 0711.0185.
[69] Terence Tao,et al. An Inverse Theorem for the Uniformity Seminorms Associated with the Action of F , 2010 .
[70] Madhur Tulsiani,et al. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[71] Fan Chung Graham,et al. Communication Complexity and Quasi Randomness , 1993, SIAM J. Discret. Math..
[72] Terence Tao,et al. Testability and repair of hereditary hypergraph properties , 2008, Random Struct. Algorithms.
[73] Terence Tao. A variant of the hypergraph removal lemma , 2006, J. Comb. Theory, Ser. A.
[74] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[75] Emanuele Viola,et al. Pseudorandom Bits for Polynomials , 2010, SIAM J. Comput..
[76] H. Furstenberg. Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .
[77] Alan M. Frieze,et al. The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[78] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[79] W. T. Gowers,et al. Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .
[80] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[81] Alex Samorodnitsky,et al. Low-degree tests at large distances , 2006, STOC '07.
[82] W. T. Gowers,et al. A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .