## What I learned about pseudoholomorphic quilts in the IAS cafeteria (but not at the math table)

Nathaniel Bottman

Member, School of Mathematics

September 28, 2018

Nathaniel Bottman

Member, School of Mathematics

September 28, 2018

Clemens Koppensteiner

Member, School of Mathematics

September 28, 2018

Yevgeny Liokumovich

Massachusetts Institute of Technology; Member, School of Mathematics

September 28, 2018

Daniel Litt

Columbia University; Member, School of Mathematics

September 28, 2018

Avishay Tal

University of California, Berkeley

October 1, 2018

In their seminal paper, Bennett, Bernstein, Brassard and Vazirani [SICOMP, 1997] showed that relative to an oracle, quantum algorithms are unable to solve NP-complete problems in sub-exponential time (i.e., that Grover's search is optimal in this setting).

Ángel Martínez Martínez

Universidad Autónoma de Madrid; Member, School of Mathematics

October 1, 2018

Jacob Matherne

Member, School of Mathematics

October 1, 2018

Marco Méndez Guaraco

University of Chicago; Member, School of Mathematics

October 1, 2018

Dor Minzer

Tel Aviv University; Member, School of Mathematics

October 1, 2018

Guy Moshkovitz

Member, School of Mathematics

October 1, 2018