Short pages

From Polymath1Wiki
Jump to: navigation, search

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

View (previous 50 | next 50) (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) ‎Carlson's theorem ‎[1,304 bytes]
  44. (hist) ‎Verify the bounded discrepancy of an input sequence ‎[1,306 bytes]
  45. (hist) ‎Graham-Rothschild theorem ‎[1,332 bytes]
  46. (hist) ‎Corners theorem ‎[1,346 bytes]
  47. (hist) ‎Folkman's theorem ‎[1,365 bytes]
  48. (hist) ‎"Low Dimensions" grant acknowledgments ‎[1,390 bytes]
  49. (hist) ‎Prime gaps ‎[1,392 bytes]
  50. (hist) ‎T2(x) = T5(x) = -x ‎[1,445 bytes]

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