Speaker: Marc Vinyals
Marc Vinyals is a visiting fellow at the Technion. He works on
computational complexity, and proof complexity in particular, hosted
by Yuval Filmus. His research interests include other areas of
computational complexity such as circuit complexity, communication
complexity, query complexity, and pebble games, as well as the theory
of satisfiability solving. Previously he was a graduate student at the
KTH Royal Institute of Technology, supervised by Jakob Nordström, and
a visiting fellow at the Tata Institute of Fundamental Research,
hosted by Arkadev Chattopadhyay.
Location : Via Zoom
Event Type: Faculty Candidate Talk
Abstract: Even though the origins of proof complexity are intimately tied to theP vs NP question, nowadays a significant part of the appeal ofresearch in this area is that new results readily apply to largeclasses of algorithms. In this talk we will discuss how recentdevelopments in proof complexity are impacting the design ofsatisfiability solvers, how fine-grained mathematical models can helpus smooth over discrepancies between theory and practice, and howquestions arising from implementation details end up as meaningfulmathematical problems with connections to other topics incomputational complexity.
Contact Host: Dr. Martin Farach-Colton
Join the zoom: https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Frutgers.zoom.us%2Fj%2F97214308635%3Fpwd%3DYmdtN1hkd2NlSlowdFIxcFRodjBmQT09&data=04%7C01%7Ccvn16%40cs.rutgers.edu%7C83137cd077954ad0e1ce08d8cf682cd2%7Cb92d2b234d35447093ff69aca6632ffe%7C1%7C0%7C637487393622080578%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=j%2Fd9cP9%2FEs%2B56RgDY6qZYmg2dhz17yY8r5Se4LLcMsk%3D&reserved=0