Pages with the fewest revisions

Showing below up to 100 results in range #1 to #100.

1. Biblio.tex‏‎ (1 revision)
2. Matlab script‏‎ (1 revision)
3. Szemerédi's regularity lemma‏‎ (1 revision)
4. The complexity class DTIME‏‎ (1 revision)
5. 4D Moser sets with d at least 2 have at most 42 points‏‎ (1 revision)
6. Outline.tex‏‎ (1 revision)
7. The HAP-subsequence structure of that sequence‏‎ (1 revision)
8. T2(x) = -T3(x)‏‎ (1 revision)
9. Cramer's random model for the primes‏‎ (1 revision)
10. HAP tables for Sequence of length 470‏‎ (1 revision)
11. The complexity class BQP‏‎ (1 revision)
12. Kruskal-Katona theorem‏‎ (1 revision)
13. Prove the result for shifted HAPs instead of HAPs‏‎ (1 revision)
14. Austin's proof‏‎ (1 revision)
15. List of results implied by the Riemann Hypothesis‏‎ (1 revision)
16. Verify the bounded discrepancy of sequence‏‎ (1 revision)
17. Sequence of length 1091‏‎ (1 revision)
18. Depth-first search‏‎ (1 revision)
19. Easy.tex‏‎ (1 revision)
20. Stdout output‏‎ (1 revision)
21. Classification of (6,12,18,4,0) sets‏‎ (1 revision)
22. Optimal a-set pairs‏‎ (1 revision)
23. Signed sums of prime reciprocals‏‎ (1 revision)
24. Finding primes with O(k) random bits‏‎ (1 revision)
25. Hardy-Littlewood prime tuples conjecture‏‎ (1 revision)
26. 4D Moser sets with d at least 4 have at most 40 points‏‎ (1 revision)
27. Side Proof 7‏‎ (1 revision)
28. File output‏‎ (1 revision)
29. A-statistics code‏‎ (1 revision)
30. Iterated sumsets of log-primes‏‎ (1 revision)
31. HAP table for Sequence of length 1112‏‎ (1 revision)
32. Search for completely multiplicative sequences‏‎ (1 revision)
33. Human proof of the 3D Pareto-optimal Moser statistics‏‎ (1 revision)
34. Side Proof 2‏‎ (1 revision)
35. Side Proof 3‏‎ (1 revision)
36. Optimal a-set pair code‏‎ (1 revision)
37. Que porra n tem nada pra fazer network penetration test‏‎ (1 revision)
38. Side Proof 6‏‎ (1 revision)
39. Computing a HAP basis‏‎ (1 revision)
40. Side Proof 1‏‎ (1 revision)
41. 4D Moser sets with d at least 3 has at most 41 points‏‎ (1 revision)
42. Word algebra‏‎ (1 revision)
43. Proposals for finding long low-discrepancy sequences‏‎ (1 revision)
44. 4th roots of unity‏‎ (1 revision)
45. DJH(1,3)‏‎ (2 revisions)
46. Vectors for the dual SDP‏‎ (2 revisions)
47. Outro.tex‏‎ (2 revisions)
48. Szemerédi's original proof of Szemerédi's theorem‏‎ (2 revisions)
49. Smooth number‏‎ (2 revisions)
50. Lemma 7.5‏‎ (2 revisions)
51. Discrete logarithm‏‎ (2 revisions)
52. Forced Drift of Six in Multiplicative Sequences‏‎ (2 revisions)
53. Density‏‎ (2 revisions)
54. Corners‏‎ (2 revisions)
55. Equal-slices distribution for DHJ(k)‏‎ (2 revisions)
56. T32-invariant sequences‏‎ (2 revisions)
57. Lindell's Critique‏‎ (2 revisions)
58. Generic prime‏‎ (2 revisions)
59. Lookup table C code‏‎ (2 revisions)
60. Maximal discrepancy-2 sequence‏‎ (2 revisions)
61. Overlapping Schwarz‏‎ (2 revisions)
62. Original Elsevier statement‏‎ (2 revisions)
63. Concentration of measure‏‎ (2 revisions)
64. T2(x) = T5(x) = -x‏‎ (2 revisions)
65. Friedlander-Iwaniec theorem‏‎ (2 revisions)
66. Depth-first search for multiplicative sequences‏‎ (2 revisions)
67. C code for Moser‏‎ (2 revisions)
68. Factoring‏‎ (2 revisions)
69. Coloring R 2‏‎ (2 revisions)
70. Algorithm for finding multiplicative sequences with bounded discrepancy‏‎ (2 revisions)
71. The complexity class P‏‎ (2 revisions)
72. Obtaining the correct bound in Roth's discrepancy theorem‏‎ (2 revisions)
73. Odlyzko's method‏‎ (2 revisions)
74. The complexity class NP‏‎ (2 revisions)
75. First obtain multiplicative structure and then obtain a contradiction‏‎ (2 revisions)
76. Side Proof 8‏‎ (2 revisions)
77. M=13 Theorem‏‎ (2 revisions)
78. Bounded Dirichlet inverse‏‎ (2 revisions)
79. Triangle removal lemma‏‎ (2 revisions)
80. Szemerédi's combinatorial proof of Roth's theorem‏‎ (2 revisions)
81. Abstract regularity lemma‏‎ (2 revisions)
82. 6th roots of unity‏‎ (2 revisions)
83. Sperner.tex‏‎ (2 revisions)
84. Genetic.tex‏‎ (2 revisions)
85. Immerman's letter‏‎ (2 revisions)
86. Pseudo-random generators (PRG)‏‎ (2 revisions)
87. "New Proof" grant acknowledgments‏‎ (3 revisions)
88. Topological dynamics formulation‏‎ (3 revisions)
89. Immerman-Vardi theorem‏‎ (3 revisions)
90. P=NP implies a deterministic algorithm to find primes‏‎ (3 revisions)
91. 3D Moser statistics‏‎ (3 revisions)
92. Polymath4 grant acknowledgments‏‎ (3 revisions)
93. Szemerédi's theorem‏‎ (3 revisions)
94. Definable Banach Spaces‏‎ (3 revisions)
95. Intransitive dice‏‎ (3 revisions)
96. Polymath15 grant acknowledgments‏‎ (3 revisions)
97. Character-like functions‏‎ (3 revisions)
98. Matryoshka Sequences‏‎ (3 revisions)
99. Sequence of length 1112‏‎ (3 revisions)
100. Correlation with a 1-set implies correlation with a subspace‏‎ (3 revisions)