/explore
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,... | |
| | | | |
polymathprojects.org
|
|
| | | | | This post tentatively kicks off Polymath 12 on Rota's basis conjecture. I proposed Rota's basis conjecture as a possible Polymath project on MathOverflow last year. If you have not read my proposal, I strongly recommend that you read it now, because in it, I sketched some reasons why I thought this would make a good... | |
| | | | |
polymathprojects.org
|
|
| | | | | It's probably time to refresh the previous thread for the "finding primes" project, and to summarise the current state of affairs. The current goal is to find a deterministic way to locate a prime in an interval $latex [z,2z]$ in time that breaks the "square root barrier" of $latex \sqrt(z)$ (or more precisely, $latex z^{1/2+o(1)}$).... | |
| | | | |
blog.georgeshakan.com
|
|
| | | Principal Component Analysis (PCA) is a popular technique in machine learning for dimension reduction. It can be derived from Singular Value Decomposition (SVD) which we will discuss in this post. We will cover the math, an example in python, and finally some intuition. The Math SVD asserts that any $latex m \times d$ matrix $latex... | ||
