Explore the fascinating world of sublinear time property testers in this 28-minute conference talk by Louis-Pascal Xhonneux. Delve into the concept of property testing, which aims to determine whether an unknown function possesses a specific property. Learn how this decision problem is relaxed through two key aspects: the promise that the property is either satisfied or far from being satisfied, and the allowance for a small error probability. Discover how these relaxations enable the creation of incredibly fast testers that operate in sublinear time relative to input size. Examine two illustrative example problems: testing graph bipartiteness and checking if a binary input sequence contains a fixed string as a subsequence. Gain insights into the sublinear query complexity of these algorithms and how they read only a fraction of the input. Conclude with a brief survey of related areas and their connections to property testing, broadening your understanding of this intriguing field in computer science. Read more