]. A. Balog, V. Blomer, C. Dartyge, G. Tenenbaum-]-r, C. Crandall et al., Friable values of binary forms Prime numbers, a computational perspective Sommes sans grand facteur premier, [5] S. Drappeau, Sur les solutions friables de l'´ equation a + b = c, Math. Proc. Cambridge Philos. Soc. Sommes friables d'exponentielles et applications, pp.639-667, 1999.

J. , M. Fouvry, and G. Tenenbaum, Asymptotics for multilinear averages of multiplicative functions A new proof of Szemerédi's theorem Smooth numbers: computational number theory and beyond, Algorithmic number theory: lattices, number fields, curves and cryptography The Möbius function is strongly orthogonal to nilsequences The quantitative behaviour of polynomial orbits on nilmanifolds, Entiers sans grand facteur premier en progressions arithmetiques Host Math. Proc. Camb. Phil. Soc. [9] W. T. Gowers Linear equations in primes An inverse theorem for the Gowers U s+1 Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers, pp.597-638, 1991.

H. L. Soc, R. C. Montgomery, and . Vaughan, Linear correlations amongst numbers represented by positive definite binary quadratic forms, Acta Arith Correlations of representation functions of binary quadratic forms, Acta Arith, Exponential sums with multiplicative coefficients, Invent. Math, pp.827-858, 1977.