Speaker:

Jianbo Wang (University of Electronic Science and Technology of China)

Time:

• 16:20-17:20 (Time in Beijing)
• November 18, 2022 (Friday)

Venue:

518, Research Building 4

Abstract:

Let \mathbb{F} be any field, we consider solving Ax=b for a matrix A\in\mathbb{F}^{n\times n} of m non-zero elements. If we are given a zero forcing set of A of size k, we can solve the problem in O(mk+k^\omega) time. The algorithm is inspired by the light chasing algorithm for grid graphs.