Dead-end pages
From Polymath Wiki
Jump to navigationJump to search
The following pages do not link to other pages in Polymath Wiki.
Showing below up to 50 results in range #101 to #150.
- Outline.tex
- Outline of first paper
- Outro.tex
- Overlapping Schwarz
- P=NP implies a deterministic algorithm to find primes
- Partitioning.tex
- Polylog parameterizability
- Polymath15 grant acknowledgments
- Polymath4 grant acknowledgments
- Polymath8 grant acknowledgments
- Probabilistic formulation of Hadwiger-Nelson problem
- Proposals for finding long low-discrepancy sequences
- Prove the result for shifted HAPs instead of HAPs
- Pseudo-random generators (PRG)
- Que porra n tem nada pra fazer network penetration test
- Random k-SAT
- Refined greedy computation of multiplicative sequences
- Riemann-Siegel formula
- Rota's conjecture
- Roth's Theorem concerning discrepancy on Arithmetic Progression
- Scanning code
- Search for completely multiplicative sequences
- Second attempt at computing H t(x) for negative t
- Second lookup table C code
- Sequence of length 1091
- Sequence of length 3250
- Sequence of length 714
- Sequences given by modulated Sturmian functions
- Shifts and signs
- Short sequences statistics
- Side Proof 2
- Side Proof 5
- Side Proof 6
- Side Proof 7
- Side Proof 8
- Side Proof 9
- Sperner.tex
- Stability of eigenfunctions
- Stdout output
- Stirling's formula
- Szemerédi's regularity lemma
- T2(x) = -T3(x)
- T2(x) = -x
- T2(x) = T5(x) = -x
- T32-invariant sequences
- The Erdos-Rado sunflower lemma
- The HAP-subsequence structure of that sequence
- The complexity class BPP
- The complexity class BQP
- The complexity class DTIME