ICPC University hosts several lectures series designed as part of the journey to becoming better problem solvers
In his lecture, Huacheng will give an introduction to succinct data structures. He will explain what is a succinct data structure, and present two such data structures in detail, for the rank problem and the problem of storing base-B vectors respectively. Finally, he will list a few more results in this area and state an open question.
In a recent result known as MIP *= RE, ideas from three disparate fields of study — computational complexity theory, quantum information, and operator algebras — have come together to simultaneously resolve long-standing open problems in each field, including a 44-year old mystery in mathematics known as Connes’ Embedding Problem. In this talk, Henry will describe the evolution and convergence of ideas behind MIP *= RE: it starts with three landmark discoveries from the 1930s (Turing’s notion of a universal computing machine, the phenomenon of quantum entanglement, and von Neumann’s theory of operators), and ends with some of the most cutting-edge developments from theoretical computer science and quantum computing.
Mikhail will speak about solving the “Expected Damage” Problem in Kotlin With Probabilities and Modular Arithmetic.