Computing Minimal Persistent Cycles - Polynomial and Hard Cases

Computing Minimal Persistent Cycles - Polynomial and Hard Cases

Applied Algebraic Topology Network via YouTube Direct link

Intro

1 of 12

1 of 12

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Computing Minimal Persistent Cycles - Polynomial and Hard Cases

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Barcode/Persistence diagram
  3. 3 Problem definition
  4. 4 Summary
  5. 5 Weak pseudomanifold
  6. 6 Duality
  7. 7 Correctness of Algorithm 1
  8. 8 Void boundary reconstruction: Orientation
  9. 9 Preprocessing
  10. 10 Correctness of Algorithm 2
  11. 11 Suspension: Shifting dimension for reduction
  12. 12 Infinite interval hardness

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.