Mathematics Events

November 3, 2020

Tuesday, November 3

Los Angeles Combinatorics and Complexity Seminar: Link crossing number is NP-hard
This is a past event.

Arnaud De Mesmay, LIGM, Université Paris Est, France Abstract: Most invariants in knot theory are very hard to compute in practice, yet only few...

11/3/2020 9:30am
Virtual Event
Los Angeles Combinatorics and Complexity Seminar: Shellability is NP-complete
This is a past event.

Zuzana Patáková, Charles University, Prague, Czech Republic Abstract: Shellability is an important notion that lead to such mathematical discoveries as the...

11/3/2020 10:15am
Virtual Event