Short pages

From Polymath Wiki
Jump to: navigation, search

Showing below up to 20 results in range #21 to #40.

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

  1. (hist) ‎Density ‎[795 bytes]
  2. (hist) ‎The complexity class BQP ‎[795 bytes]
  3. (hist) ‎Immerman-Vardi theorem ‎[798 bytes]
  4. (hist) ‎P=NP implies a deterministic algorithm to find primes ‎[819 bytes]
  5. (hist) ‎Kruskal-Katona theorem ‎[840 bytes]
  6. (hist) ‎Lemma 7 ‎[845 bytes]
  7. (hist) ‎Corners ‎[863 bytes]
  8. (hist) ‎Prove the result for shifted HAPs instead of HAPs ‎[879 bytes]
  9. (hist) ‎Polymath4 grant acknowledgments ‎[915 bytes]
  10. (hist) ‎Sequence of length 714 ‎[922 bytes]
  11. (hist) ‎Szemerédi's theorem ‎[924 bytes]
  12. (hist) ‎Roth's theorem ‎[973 bytes]
  13. (hist) ‎Longest constrained sequences ‎[1,059 bytes]
  14. (hist) ‎T32-invariant sequences ‎[1,070 bytes]
  15. (hist) ‎Shifts and signs ‎[1,075 bytes]
  16. (hist) ‎Generic prime ‎[1,087 bytes]
  17. (hist) ‎TeX files for first paper ‎[1,099 bytes]
  18. (hist) ‎Schinzel's hypothesis H ‎[1,130 bytes]
  19. (hist) ‎Sylvester's sequence ‎[1,151 bytes]
  20. (hist) ‎Verify the bounded discrepancy of sequence ‎[1,156 bytes]

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