A code C is said to be Locally Decodable Code with q queries if
it is possible to recover any symbol x_j of a message x by making
at most q queries to C(x), such that even if a constant fraction of
C(x) is corrupted, the decoding algorithm...
In this seminar I will discuss the details of the result that
knottedness is in NP assuming the generalized Riemann hypothesis.
The main part of the work is to properly understand Koiran's
construction that solvability of a system of algebraic...
