Algorithmic regularity for polynomials and applications

SODA, pp. 1870-1889, 2015.

Cited by: 16|Bibtex|Views9|Links
EI

Abstract:

In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials proved by Green and Tao [GT09] and by Kaufman and Lovett [KL08] show that one can modify a given collection of polynomials F = {P1, . . ., Pm} into a new collection F' so that the polynomials in F' are \"pseudorandom\". These lemmas have various a...More

Code:

Data:

Your rating :
0

 

Tags
Comments