Top Network Posts
- 19Kolmogorov complexity is the strongest noncomputable function
- 17Kolmogorov complexity is the strongest noncomputable function
- 11An efficient isomorphism between finite fields
- 7Upper bound for number of prime numbers in a range
- 7On correct use of the indefinite article
- 7Parity P and AM
- 6explict form of the equation of elliptic curve
- View more network posts →
Keeping a low profile.
This user hasn't posted... yet.