School of Technology and Computer Science Seminars
Deterministic Representation of Linear Matroids
by Pranabendu Misra (Max Planck Institute for Informatics Saarbrucken, Germany.)
Tuesday, January 21, 2020
from
to
(Asia/Kolkata)
at A-201 (STCS Seminar Room)
at A-201 (STCS Seminar Room)
Description |
Matroids are combinatorial objects that generalize the notion of linear independence. They have several applications in design and analysis of algorithms. Linear matroids are a subclass of matroids that can be represented by a matrix. Recently, these matroids have found applications in Parameterized Complexity, including some breakthrough results. In this talk, we will discuss the problem of constructing a matrix representation of linear matroids, especially via deterministic algorithms. |
Organised by | Ramprasad Saptharishi |