Long pages

From Polymath1Wiki
Jump to: navigation, search

Showing below up to 100 results in range #151 to #250.

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

  1. (hist) ‎Equal-slices distribution for DHJ(k) ‎[6,254 bytes]
  2. (hist) ‎A-statistics code ‎[6,211 bytes]
  3. (hist) ‎Computing a HAP basis ‎[6,179 bytes]
  4. (hist) ‎Outline of second paper ‎[6,145 bytes]
  5. (hist) ‎Overlapping Schwarz ‎[6,077 bytes]
  6. (hist) ‎Depth-first search for multiplicative sequences ‎[6,064 bytes]
  7. (hist) ‎Ergodic perspective ‎[5,712 bytes]
  8. (hist) ‎A Hilbert space lemma ‎[5,659 bytes]
  9. (hist) ‎Topological dynamics formulation ‎[5,599 bytes]
  10. (hist) ‎Stdout output ‎[5,585 bytes]
  11. (hist) ‎Immerman's letter ‎[5,561 bytes]
  12. (hist) ‎Drift ‎[5,553 bytes]
  13. (hist) ‎Genetic algorithm ‎[5,490 bytes]
  14. (hist) ‎Obstructions to uniformity ‎[5,460 bytes]
  15. (hist) ‎Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity ‎[5,449 bytes]
  16. (hist) ‎Boshernitzan’s problem ‎[5,421 bytes]
  17. (hist) ‎Polymath8 grant acknowledgments ‎[5,366 bytes]
  18. (hist) ‎C code for Moser ‎[5,341 bytes]
  19. (hist) ‎Multiplicative.c ‎[5,268 bytes]
  20. (hist) ‎BK:Section 3 ‎[5,254 bytes]
  21. (hist) ‎DHJ(2.6) ‎[5,155 bytes]
  22. (hist) ‎4D Moser sets with d at least 3 has at most 41 points ‎[5,067 bytes]
  23. (hist) ‎Bounded discrepancy multiplicative functions do not correlate with characters ‎[5,056 bytes]
  24. (hist) ‎Lemma 8 ‎[4,999 bytes]
  25. (hist) ‎Lemma 7.5 ‎[4,941 bytes]
  26. (hist) ‎Maximal discrepancy-2 sequence ‎[4,928 bytes]
  27. (hist) ‎Side Proof 2 ‎[4,853 bytes]
  28. (hist) ‎Lindell's Critique ‎[4,820 bytes]
  29. (hist) ‎Jun Fukuyama's P≠NP Paper ‎[4,808 bytes]
  30. (hist) ‎Riemann-Siegel formula ‎[4,765 bytes]
  31. (hist) ‎Pseudo-random generators (PRG) ‎[4,736 bytes]
  32. (hist) ‎Updating partial sums with Fenwick tree ‎[4,712 bytes]
  33. (hist) ‎Integer.tex ‎[4,708 bytes]
  34. (hist) ‎Kakeya problem ‎[4,701 bytes]
  35. (hist) ‎Lookup table ‎[4,631 bytes]
  36. (hist) ‎Wirsing translation ‎[4,551 bytes]
  37. (hist) ‎Ergodic-inspired methods ‎[4,540 bytes]
  38. (hist) ‎Bounding the derivative of H t ‎[4,473 bytes]
  39. (hist) ‎Fourier reduction ‎[4,297 bytes]
  40. (hist) ‎Outline of first paper ‎[4,289 bytes]
  41. (hist) ‎A general result about density increments ‎[4,156 bytes]
  42. (hist) ‎Original Elsevier statement ‎[4,139 bytes]
  43. (hist) ‎Basic facts about Bohr sets ‎[4,137 bytes]
  44. (hist) ‎Generalize to a graph-theoretic formulation ‎[4,137 bytes]
  45. (hist) ‎Matryoshka Sequences ‎[4,095 bytes]
  46. (hist) ‎Abstract regularity lemma ‎[4,045 bytes]
  47. (hist) ‎Polynomial strategy ‎[4,038 bytes]
  48. (hist) ‎Triangle removal lemma ‎[4,020 bytes]
  49. (hist) ‎Classification of (6,12,18,4,0) sets ‎[3,974 bytes]
  50. (hist) ‎Coloring.tex ‎[3,969 bytes]
  51. (hist) ‎Bibliography ‎[3,958 bytes]
  52. (hist) ‎Short sequences statistics ‎[3,900 bytes]
  53. (hist) ‎Dhj.sty ‎[3,870 bytes]
  54. (hist) ‎Quasirandomness ‎[3,823 bytes]
  55. (hist) ‎Unsolved problems ‎[3,730 bytes]
  56. (hist) ‎Length 1124 sequences ‎[3,729 bytes]
  57. (hist) ‎Upper and lower discrepancy ‎[3,692 bytes]
  58. (hist) ‎4th roots of unity ‎[3,655 bytes]
  59. (hist) ‎Proposals for finding long low-discrepancy sequences ‎[3,583 bytes]
  60. (hist) ‎Concentration of measure ‎[3,496 bytes]
  61. (hist) ‎Side Proof 1 ‎[3,474 bytes]
  62. (hist) ‎Szemerédi's original proof of Szemerédi's theorem ‎[3,375 bytes]
  63. (hist) ‎DHJ(2.7) ‎[3,205 bytes]
  64. (hist) ‎The complexity class P ‎[3,159 bytes]
  65. (hist) ‎Lemma 7.6 ‎[3,144 bytes]
  66. (hist) ‎Definable Banach Spaces ‎[3,082 bytes]
  67. (hist) ‎Complexity of a set ‎[3,043 bytes]
  68. (hist) ‎List of results implied by the Riemann Hypothesis ‎[3,032 bytes]
  69. (hist) ‎The complexity class promise-BPP ‎[3,028 bytes]
  70. (hist) ‎Logo ‎[2,935 bytes]
  71. (hist) ‎DHJ(k) implies multidimensional DHJ(k) ‎[2,877 bytes]
  72. (hist) ‎Influence of variables ‎[2,855 bytes]
  73. (hist) ‎Different upper and lower bound ‎[2,833 bytes]
  74. (hist) ‎Horn clause formulation ‎[2,778 bytes]
  75. (hist) ‎Function field version ‎[2,738 bytes]
  76. (hist) ‎Improving the bounds for Roth's theorem ‎[2,733 bytes]
  77. (hist) ‎T2(x) = -x ‎[2,710 bytes]
  78. (hist) ‎Line ‎[2,675 bytes]
  79. (hist) ‎Higher-dimensional Fujimura ‎[2,574 bytes]
  80. (hist) ‎Side Proof 6 ‎[2,563 bytes]
  81. (hist) ‎Que porra n tem nada pra fazer network penetration test ‎[2,545 bytes]
  82. (hist) ‎Genetic.tex ‎[2,499 bytes]
  83. (hist) ‎Meissel-Lehmer method ‎[2,436 bytes]
  84. (hist) ‎Correlation with a 1-set implies correlation with a subspace ‎[2,357 bytes]
  85. (hist) ‎An efficient algorithm exists if Cramer's conjecture holds ‎[2,335 bytes]
  86. (hist) ‎Dhj.bib ‎[2,328 bytes]
  87. (hist) ‎6th roots of unity ‎[2,290 bytes]
  88. (hist) ‎Sequence of length 1112 ‎[2,289 bytes]
  89. (hist) ‎Representation of the diagonal ‎[2,265 bytes]
  90. (hist) ‎The complexity class BPP ‎[2,225 bytes]
  91. (hist) ‎Szemerédi's combinatorial proof of Roth's theorem ‎[2,190 bytes]
  92. (hist) ‎Fujimura.tex ‎[2,139 bytes]
  93. (hist) ‎Bounded Dirichlet inverse ‎[2,137 bytes]
  94. (hist) ‎M=13 Theorem ‎[2,086 bytes]
  95. (hist) ‎Side Proof 5 ‎[2,054 bytes]
  96. (hist) ‎Side Proof 8 ‎[2,051 bytes]
  97. (hist) ‎Linear norm grant acknowledgments ‎[1,979 bytes]
  98. (hist) ‎First obtain multiplicative structure and then obtain a contradiction ‎[1,955 bytes]
  99. (hist) ‎The complexity class NP ‎[1,899 bytes]
  100. (hist) ‎Search for completely multiplicative sequences ‎[1,853 bytes]

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

Retrieved from "http://michaelnielsen.org/polymath1/index.php?title=Special:LongPages"