Short pages

From Polymath1Wiki
Jump to: navigation, search

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

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)

  1. (hist) ‎DJH(1,3) ‎[0 bytes]
  2. (hist) ‎Benchmarks of small admissible tuples ‎[25 bytes]
  3. (hist) ‎Biblio.tex ‎[44 bytes]
  4. (hist) ‎Sequence of length 3250 ‎[79 bytes]
  5. (hist) ‎Szemerédi's regularity lemma ‎[119 bytes]
  6. (hist) ‎Outro.tex ‎[208 bytes]
  7. (hist) ‎The complexity class DTIME ‎[436 bytes]
  8. (hist) ‎Hindman's theorem ‎[454 bytes]
  9. (hist) ‎Dhj.tex ‎[477 bytes]
  10. (hist) ‎Smooth number ‎[498 bytes]
  11. (hist) ‎Carlson-Simpson theorem ‎[561 bytes]
  12. (hist) ‎Discretized Borel Determinacy and P=NP ‎[588 bytes]
  13. (hist) ‎"New Proof" grant acknowledgments ‎[645 bytes]
  14. (hist) ‎The HAP-subsequence structure of that sequence ‎[708 bytes]
  15. (hist) ‎Cramer's conjecture ‎[724 bytes]
  16. (hist) ‎T2(x) = -T3(x) ‎[735 bytes]
  17. (hist) ‎Discrete logarithm ‎[745 bytes]
  18. (hist) ‎Cramer's random model for the primes ‎[757 bytes]
  19. (hist) ‎Convert raw input string into CSV table ‎[765 bytes]
  20. (hist) ‎Side Proof 9 ‎[766 bytes]
  21. (hist) ‎Density ‎[795 bytes]
  22. (hist) ‎The complexity class BQP ‎[795 bytes]
  23. (hist) ‎Immerman-Vardi theorem ‎[798 bytes]
  24. (hist) ‎P=NP implies a deterministic algorithm to find primes ‎[819 bytes]
  25. (hist) ‎Kruskal-Katona theorem ‎[840 bytes]
  26. (hist) ‎Lemma 7 ‎[845 bytes]
  27. (hist) ‎Corners ‎[863 bytes]
  28. (hist) ‎Prove the result for shifted HAPs instead of HAPs ‎[879 bytes]
  29. (hist) ‎Polymath4 grant acknowledgments ‎[915 bytes]
  30. (hist) ‎Sequence of length 714 ‎[922 bytes]
  31. (hist) ‎Szemerédi's theorem ‎[924 bytes]
  32. (hist) ‎Roth's theorem ‎[973 bytes]
  33. (hist) ‎Longest constrained sequences ‎[1,059 bytes]
  34. (hist) ‎T32-invariant sequences ‎[1,070 bytes]
  35. (hist) ‎Shifts and signs ‎[1,075 bytes]
  36. (hist) ‎Generic prime ‎[1,087 bytes]
  37. (hist) ‎TeX files for first paper ‎[1,099 bytes]
  38. (hist) ‎Schinzel's hypothesis H ‎[1,130 bytes]
  39. (hist) ‎Sylvester's sequence ‎[1,151 bytes]
  40. (hist) ‎Verify the bounded discrepancy of sequence ‎[1,156 bytes]
  41. (hist) ‎Abstract.tex ‎[1,239 bytes]
  42. (hist) ‎Sequence of length 1091 ‎[1,267 bytes]
  43. (hist) ‎Intransitive dice ‎[1,279 bytes]
  44. (hist) ‎Polymath15 grant acknowledgments ‎[1,297 bytes]
  45. (hist) ‎Carlson's theorem ‎[1,304 bytes]
  46. (hist) ‎Verify the bounded discrepancy of an input sequence ‎[1,306 bytes]
  47. (hist) ‎Graham-Rothschild theorem ‎[1,332 bytes]
  48. (hist) ‎Corners theorem ‎[1,346 bytes]
  49. (hist) ‎Folkman's theorem ‎[1,365 bytes]
  50. (hist) ‎"Low Dimensions" grant acknowledgments ‎[1,390 bytes]
  51. (hist) ‎Prime gaps ‎[1,392 bytes]
  52. (hist) ‎T2(x) = T5(x) = -x ‎[1,445 bytes]
  53. (hist) ‎Signed sums of prime reciprocals ‎[1,447 bytes]
  54. (hist) ‎Finding primes with O(k) random bits ‎[1,454 bytes]
  55. (hist) ‎Hardy-Littlewood prime tuples conjecture ‎[1,474 bytes]
  56. (hist) ‎Kolmogorov complexity ‎[1,509 bytes]
  57. (hist) ‎Character-like functions ‎[1,523 bytes]
  58. (hist) ‎Friedlander-Iwaniec theorem ‎[1,583 bytes]
  59. (hist) ‎Sequences given by modulated Sturmian functions ‎[1,612 bytes]
  60. (hist) ‎Slice ‎[1,662 bytes]
  61. (hist) ‎Side Proof 7 ‎[1,666 bytes]
  62. (hist) ‎File output ‎[1,684 bytes]
  63. (hist) ‎Factoring ‎[1,704 bytes]
  64. (hist) ‎The prime factors of the places where the first two sequences of length 1124 differ ‎[1,706 bytes]
  65. (hist) ‎Stirling's formula ‎[1,713 bytes]
  66. (hist) ‎W-trick ‎[1,739 bytes]
  67. (hist) ‎Combinatorial subspace ‎[1,771 bytes]
  68. (hist) ‎Algorithm for finding multiplicative sequences with bounded discrepancy ‎[1,818 bytes]
  69. (hist) ‎M=13 case of FUNC ‎[1,820 bytes]
  70. (hist) ‎Thue-Morse-Hedlund Sequence ‎[1,831 bytes]
  71. (hist) ‎Odlyzko's method ‎[1,846 bytes]
  72. (hist) ‎Search for completely multiplicative sequences ‎[1,853 bytes]
  73. (hist) ‎The complexity class NP ‎[1,899 bytes]
  74. (hist) ‎First obtain multiplicative structure and then obtain a contradiction ‎[1,955 bytes]
  75. (hist) ‎Linear norm grant acknowledgments ‎[1,979 bytes]
  76. (hist) ‎Side Proof 8 ‎[2,051 bytes]
  77. (hist) ‎Side Proof 5 ‎[2,054 bytes]
  78. (hist) ‎M=13 Theorem ‎[2,086 bytes]
  79. (hist) ‎Bounded Dirichlet inverse ‎[2,137 bytes]
  80. (hist) ‎Fujimura.tex ‎[2,139 bytes]
  81. (hist) ‎Szemerédi's combinatorial proof of Roth's theorem ‎[2,190 bytes]
  82. (hist) ‎The complexity class BPP ‎[2,225 bytes]
  83. (hist) ‎Representation of the diagonal ‎[2,265 bytes]
  84. (hist) ‎Sequence of length 1112 ‎[2,289 bytes]
  85. (hist) ‎6th roots of unity ‎[2,290 bytes]
  86. (hist) ‎Dhj.bib ‎[2,328 bytes]
  87. (hist) ‎An efficient algorithm exists if Cramer's conjecture holds ‎[2,335 bytes]
  88. (hist) ‎Correlation with a 1-set implies correlation with a subspace ‎[2,357 bytes]
  89. (hist) ‎Meissel-Lehmer method ‎[2,436 bytes]
  90. (hist) ‎Genetic.tex ‎[2,499 bytes]
  91. (hist) ‎Que porra n tem nada pra fazer network penetration test ‎[2,545 bytes]
  92. (hist) ‎Side Proof 6 ‎[2,563 bytes]
  93. (hist) ‎Higher-dimensional Fujimura ‎[2,574 bytes]
  94. (hist) ‎Line ‎[2,675 bytes]
  95. (hist) ‎T2(x) = -x ‎[2,710 bytes]
  96. (hist) ‎Improving the bounds for Roth's theorem ‎[2,733 bytes]
  97. (hist) ‎Function field version ‎[2,738 bytes]
  98. (hist) ‎Horn clause formulation ‎[2,778 bytes]
  99. (hist) ‎Different upper and lower bound ‎[2,833 bytes]
  100. (hist) ‎Influence of variables ‎[2,855 bytes]

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)