We construct a family of high order iteration functions for finding polynomial roots of a known multiplicity s. This family is a generalization of a fundamental family of high order algorithms for ...

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, ...

The Grover search algorithm is an efficient quantum search algorithm that can find a target element in an unstructured database with a time complexity of the square root of the number of elements.