Hi all,

as nobody volunteered for tomorrow, we will again turn to the internet: we will watch a talk from TCS+ https://sites.google.com/site/plustcs/home

As the today's talk looks enticing, let's try this one. The speaker is Nima Anari (Stanford) and the title Planar Graph Perfect Matching is in NC.

Here, NC means existence of a deterministic fast parallel algorithm for the problem. Don't worry if you never considered such question, based on the paper it should be approachable by a wide audience.

https://arxiv.org/pdf/1709.07822.pdf

The talk is planned for one hour, so let us meet at 10:40 (sharp!) in our usual S6.

Btw, after the seminar there is a noon seminar (in the same room), so a) you should go to both and b) we must end on time.

See you tomorrow,

R

-- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague