Meeting 4.2: The complexity of unknot recognitionI discuss what's known about the computational complexity of unknot recognition. You might want to watch Marc Lackenby's recent talk after watching this.
From Eric Samperton
| 26
26 plays
| 0
|
![]() | Contact Technology Services to report an issue, offer feedback, or request assistance. |
Technology Services Home | Kaltura Help | Privacy Policy | |
Illinois Media Space, © 2022 Board of Trustees of the University of Illinois |