Conference ProceedingsOPEN ACCESS

Dense model theorems and their applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6597 LNCS 55-57
DOI: 10.1007/978-3-642-19571-6_4
4Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In 2004, Ben Green and Terry Tao [6] proved that, for every k, there are infinitely many length-k arithmetic progressions made entirely of prime numbers. This settled a very long-standing open question in number theory that had been open even for the k = 4 case. © 2011 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Trevisan, L. (2011). Dense model theorems and their applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6597 LNCS, pp. 55–57). Springer Verlag. https://doi.org/10.1007/978-3-642-19571-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free