The Fine-Grained Complexity of Pattern Counting Problems

Add to your list(s) Download to your calendar using vCal

• Marc Roth (University of Oxford)
• Friday 27 May 2022, 14:00-15:00
• LG23, SoCS and Zoom (see abstract for link).

If you have a question about this talk, please contact George Kaye.

Zoom details

• Link: https://bham-ac-uk.zoom.us/j/81873335084?pwd=T1NaUFg2U1l6d0RLL2RlTzFBam1IUT09
• Meeting ID: 818 7333 5084
• Passcode: 217

Abstract

In this talk, I will present recent progress on the complexity of pattern counting problems from the perspectives of parameterized and fine-grained complexity theory. In the first part, I will introduce and discuss “Complexity Monotonicity”, a novel and powerful tool due to Curticapean, Dell and Marx (STOC 2017), which provides a unifying view on problems that require to count small structures in large networks. In the second part, I will give an overview over recent results on the complexity of induced subgraph counting , including, among others, a dichotomy theorem for counting small induced subgraphs that satisfy hereditary properties.

Based on joint works with Julian Dörfler, Jacob Focke, Johannes Schmitt, and Philip Wellnitz.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• LG23, SoCS and Zoom (see abstract for link)
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.