Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...
This is a graduate topics course on learning in networks, focusing in particular on fundamental statistical and computational limits. Topics include the planted clique problem, community detection, ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results