YoVDO

Hardness Results in Discrete Morse Theory for 2-Complexes

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Discrete Morse Theory Courses Discrete Mathematics Courses Algorithm Design Courses Theoretical Computer Science Courses Complexity Theory Courses Algebraic Topology Courses

Course Description

Overview

Explore hardness results in discrete Morse theory for 2-complexes in this 34-minute conference talk. Delve into the problem of minimizing critical simplices (Min-Morse Matching) from inapproximability and parameterized complexity perspectives. Learn about approximation factor limitations, WP-hardness with standard parameterization, and the absence of FPT-approximation algorithms. Discover an O(n/log n)-factor algorithm for Min-Morse Matching on 2-complexes, leveraging polynomial-time erasability determination. Gain insights into monotone circuits, reductions, and constructions related to this topic in applied algebraic topology.

Syllabus

Introduction
Outline
Discrete Morse theory
Motivation
Irritability
Complexity theory
Contributions
monotone circuits
reduction
construction
knife attempt
conclusion
questions


Taught by

Applied Algebraic Topology Network

Related Courses

The Next Generation of Infrastructure
Delft University of Technology via edX
The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX
Advanced Data Structures in Java
University of California, San Diego via Coursera
Theory of Computation
Indian Institute of Technology Kanpur via Swayam
离散数学
Shanghai Jiao Tong University via Coursera