BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Rahul Ilango (MIT)
DTSTART:20200618T160000Z
DTEND:20200618T170000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/1/">A lifting-esque theorem for constant depth formulas with conse
 quences for MCSP and lower bounds</a>\nby Rahul Ilango (MIT) as part of On
 line Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Or Meir (Haifa)
DTSTART:20200702T160000Z
DTEND:20200702T170000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/2/">The KRW Conjecture: Past\, present\, and future</a>\nby Or Mei
 r (Haifa) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lijie Chen (MIT)
DTSTART:20200716T160000Z
DTEND:20200716T170000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/3/">Sharp threshold results for computational complexity</a>\nby L
 ijie Chen (MIT) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benjamin Rossman (Duke)
DTSTART:20200723T160000Z
DTEND:20200723T170000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/4/">Size-depth tradeoff for multiplying k permutations</a>\nby Ben
 jamin Rossman (Duke) as part of Online Complexity Seminar\n\nAbstract: TBA
 \n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mrinal Kumar (IIT Bombay)
DTSTART:20200806T160000Z
DTEND:20200806T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/5/">On the existence of algebraically natural proofs</a>\nby Mrina
 l Kumar (IIT Bombay) as part of Online Complexity Seminar\n\nAbstract: TBA
 \n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Srikanth Srinivasan (IIT Bombay)
DTSTART:20200820T160000Z
DTEND:20200820T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/6/">A robust version of Heged\\H{u}s's lemma</a>\nby Srikanth Srin
 ivasan (IIT Bombay) as part of Online Complexity Seminar\n\nAbstract: TBA\
 n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shuichi Hirahara (NII - Tokyo)
DTSTART:20200917T120000Z
DTEND:20200917T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/7/">Meta-complexity theoretic approach to complexity theory</a>\nb
 y Shuichi Hirahara (NII - Tokyo) as part of Online Complexity Seminar\n\nA
 bstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rafael Pass (Cornell)
DTSTART:20201001T160000Z
DTEND:20201001T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/8/">On one-way functions and Kolmogorov complexity</a>\nby Rafael 
 Pass (Cornell) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Ikenmeyer (University of Liverpool)
DTSTART:20201015T160000Z
DTEND:20201015T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/9/">Recent progress on Geometric Complexity Theory</a>\nby Christi
 an Ikenmeyer (University of Liverpool) as part of Online Complexity Semina
 r\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ryan Williams (MIT)
DTSTART:20201029T170000Z
DTEND:20201029T180000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/10/">Almost-everywhere circuit lower bounds from non-trivial deran
 domization</a>\nby Ryan Williams (MIT) as part of Online Complexity Semina
 r\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Roei Tell (MIT)
DTSTART:20201112T170000Z
DTEND:20201112T180000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/11/">Simple and fast derandomization from very hard functions - El
 iminating randomness at almost no cost</a>\nby Roei Tell (MIT) as part of 
 Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Toniann Pitassi (Toronto/IAS)
DTSTART:20201203T170000Z
DTEND:20201203T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/12/">Lifting with Sunflowers</a>\nby Toniann Pitassi (Toronto/IAS)
  as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eric Allender (Rutgers)
DTSTART:20210114T170000Z
DTEND:20210114T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/13/">Cryptographic Hardness under Projections for Time-Bounded Kol
 mogorov Complexity</a>\nby Eric Allender (Rutgers) as part of Online Compl
 exity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexandros Hollender (University of Oxford)
DTSTART:20210128T170000Z
DTEND:20210128T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/14/">The complexity of gradient descent: CLS = PPAD ∩ PLS</a>\nb
 y Alexandros Hollender (University of Oxford) as part of Online Complexity
  Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Susanna F. de Rezende (CAS\, Prague)
DTSTART:20210212T160000Z
DTEND:20210212T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/15/">Automating tree-like resolution in time n^o(log n) is ETH-har
 d</a>\nby Susanna F. de Rezende (CAS\, Prague) as part of Online Complexit
 y Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Robere (McGill)
DTSTART:20210225T170000Z
DTEND:20210225T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/16/">Amortized circuit complexity\, formal complexity measures\, a
 nd catalytic algorithms</a>\nby Robert Robere (McGill) as part of Online C
 omplexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yuval Filmus (Technion)
DTSTART:20210311T150000Z
DTEND:20210311T163000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/17
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/17/">Bounded indistinguishability for simple sources</a>\nby Yuval
  Filmus (Technion) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Avishay Tal (Berkeley)
DTSTART:20210326T170000Z
DTEND:20210326T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/18/">Pseudorandom generators for read-once monotone branching prog
 rams</a>\nby Avishay Tal (Berkeley) as part of Online Complexity Seminar\n
 \nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Josh Alman (Harvard)
DTSTART:20210408T160000Z
DTEND:20210408T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/19/">Kronecker products\, low-depth circuits\, and matrix rigidity
 </a>\nby Josh Alman (Harvard) as part of Online Complexity Seminar\n\nAbst
 ract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hanlin Ren (Tsinghua)
DTSTART:20210422T120000Z
DTEND:20210422T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/20
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/20/">Hardness of KT characterizes parallel cryptography</a>\nby Ha
 nlin Ren (Tsinghua) as part of Online Complexity Seminar\n\nAbstract: TBA\
 n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bruno Loff (Porto)
DTSTART:20210506T140000Z
DTEND:20210506T153000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/21
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/21/">Hardness of constant-round communication complexity</a>\nby B
 runo Loff (Porto) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amir Yehudayoff (Technion)
DTSTART:20210520T160000Z
DTEND:20210520T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/22
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/22/">Slicing the hypercube is not easy</a>\nby Amir Yehudayoff (Te
 chnion) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shuichi Hirahara (NII - Tokyo)
DTSTART:20210610T120000Z
DTEND:20210610T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/23
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/23/">Average-case hardness of NP from exponential worst-case hardn
 ess assumptions</a>\nby Shuichi Hirahara (NII - Tokyo) as part of Online C
 omplexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lijie Chen (MIT)
DTSTART:20210617T160000Z
DTEND:20210617T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/24
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/24/">Hardness vs Randomness\, Revised: Uniform\, Non-Black-Box\, a
 nd Instance-Wise</a>\nby Lijie Chen (MIT) as part of Online Complexity Sem
 inar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Hoza (UT Austin)
DTSTART:20210701T160000Z
DTEND:20210701T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/25
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/25/">Better pseudodistributions and derandomization for space-boun
 ded computation</a>\nby William Hoza (UT Austin) as part of Online Complex
 ity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mika Göös (EPFL)
DTSTART:20210715T160000Z
DTEND:20210715T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/26
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/26/">Unambiguous DNFs and Alon-Saks-Seymour</a>\nby Mika Göös (E
 PFL) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nutan Limaye (IIT Bombay)
DTSTART:20210709T150000Z
DTEND:20210709T163000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/27
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/27/">Superpolynomial lower bounds against low-depth algebraic circ
 uits</a>\nby Nutan Limaye (IIT Bombay) as part of Online Complexity Semina
 r\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Oliver Korten (Columbia University)
DTSTART:20210923T160000Z
DTEND:20210923T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/28/">The hardest explicit construction</a>\nby Oliver Korten (Colu
 mbia University) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rahul Ilango (MIT)
DTSTART:20211007T160000Z
DTEND:20211007T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/29
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/29/">The Minimum Formula Size Problem is (ETH) Hard</a>\nby Rahul 
 Ilango (MIT) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shyan Akmal (MIT)
DTSTART:20211028T160000Z
DTEND:20211028T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/30
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/30/">MAJORITY-3SAT (and Related Problems) in Polynomial Time</a>\n
 by Shyan Akmal (MIT) as part of Online Complexity Seminar\n\nAbstract: TBA
 \n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pranjal Dutta (CMI)
DTSTART:20211111T170000Z
DTEND:20211111T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/31
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/31/">Demystifying the border of depth-3 algebraic circuits</a>\nby
  Pranjal Dutta (CMI) as part of Online Complexity Seminar\n\nAbstract: TBA
 \n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noah Fleming (UCSD)
DTSTART:20211125T170000Z
DTEND:20211125T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/32
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/32/">Extremely Deep Proofs</a>\nby Noah Fleming (UCSD) as part of 
 Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hanlin Ren (Oxford)
DTSTART:20220804T160000Z
DTEND:20220804T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/33
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/33/">On the Range Avoidance Problem for Circuits</a>\nby Hanlin Re
 n (Oxford) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shuichi Hirahara (NII Tokyo)
DTSTART:20220825T120000Z
DTEND:20220825T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/34
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/34/">NP-Hardness of Learning Programs and Partial MCSP</a>\nby Shu
 ichi Hirahara (NII Tokyo) as part of Online Complexity Seminar\n\nAbstract
 : TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emanuele Viola (Northeastern University)
DTSTART:20220908T160000Z
DTEND:20220908T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/35
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/35/">Survey on Correlation Bounds Against Polynomials</a>\nby Eman
 uele Viola (Northeastern University) as part of Online Complexity Seminar\
 n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tom Gur (Warwick)
DTSTART:20220915T160000Z
DTEND:20220915T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/36
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/36/">Worst-Case to Average-Case Reductions via Additive Combinator
 ics</a>\nby Tom Gur (Warwick) as part of Online Complexity Seminar\n\nAbst
 ract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/36/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zhengzhong Jin (MIT)
DTSTART:20221013T160000Z
DTEND:20221013T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/37
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/37/">Indistinguishability Obfuscation via Mathematical Proofs of E
 quivalence</a>\nby Zhengzhong Jin (MIT) as part of Online Complexity Semin
 ar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Andrews (UIUC)
DTSTART:20221027T160000Z
DTEND:20221027T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/38/">On Matrix Multiplication and Polynomial Identity Testing</a>\
 nby Robert Andrews (UIUC) as part of Online Complexity Seminar\n\nAbstract
 : TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Hoza (UC Berkeley)
DTSTART:20221117T170000Z
DTEND:20221117T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/39
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/39/">Recent Progress on Derandomizing Space-Bounded Computation</a
 >\nby William Hoza (UC Berkeley) as part of Online Complexity Seminar\n\nA
 bstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/39/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ryan Williams (MIT)
DTSTART:20230601T160000Z
DTEND:20230601T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/40
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/40/">Self-Improvement for SAT</a>\nby Ryan Williams (MIT) as part 
 of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/40/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Iddo Tzameret (Imperial College London)
DTSTART:20230615T160000Z
DTEND:20230615T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/41
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/41/">Stretching Demi-Bits and Nondeterministic-Secure Pseudorandom
 ness</a>\nby Iddo Tzameret (Imperial College London) as part of Online Com
 plexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/41/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nobutaka Shimizu (Tokyo Institute of Technology)
DTSTART:20230629T120000Z
DTEND:20230629T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/42
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/42/">Hardness Self-Amplification: Simplified\, Optimized\, and Uni
 fied</a>\nby Nobutaka Shimizu (Tokyo Institute of Technology) as part of O
 nline Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/42/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Or Meir
DTSTART:20231130T130000Z
DTEND:20231130T143000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/43
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/43/">Toward Better Depth Lower Bounds: A KRW-like Theorem for Stro
 ng Composition</a>\nby Or Meir as part of Online Complexity Seminar\n\nAbs
 tract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/43/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ian Mertz
DTSTART:20231012T160000Z
DTEND:20231012T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/44
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/44/">The Tree Evaluation Problem: Context and Recent Results</a>\n
 by Ian Mertz as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/44/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Noam Mazor
DTSTART:20231019T160000Z
DTEND:20231019T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/45
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/45/">Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Co
 mplexity and Key-Agreement</a>\nby Noam Mazor as part of Online Complexity
  Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/45/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lijie Chen
DTSTART:20231026T160000Z
DTEND:20231026T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/46
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/46/">Derandomization vs Refutation: A Unified Framework for Charac
 terizing Derandomization</a>\nby Lijie Chen as part of Online Complexity S
 eminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/46/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hanlin Ren
DTSTART:20231123T170000Z
DTEND:20231123T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/47
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/47/">Bounded Relativization</a>\nby Hanlin Ren as part of Online C
 omplexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/47/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mikito Nanashima
DTSTART:20231207T130000Z
DTEND:20231207T143000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/48
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/48/">Learning in Pessiland via Inductive Inference</a>\nby Mikito 
 Nanashima as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/48/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Moritz Müller
DTSTART:20230921T120000Z
DTEND:20230921T133000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/49
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/49/">On the Consistency of Circuit Lower Bounds for Non-Determinis
 tic Time</a>\nby Moritz Müller as part of Online Complexity Seminar\n\nAb
 stract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/49/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Susanna F. de Rezende
DTSTART:20231116T170000Z
DTEND:20231116T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/50
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/50/">Average-case hardness in proof complexity</a>\nby Susanna F. 
 de Rezende as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/50/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ted Pyne (MIT)
DTSTART:20241114T170000Z
DTEND:20241114T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/51
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/51/">From Distinguishers To Predictors and Beyond</a>\nby Ted Pyne
  (MIT) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/51/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jingxun Liang (CMU)
DTSTART:20241212T170000Z
DTEND:20241212T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/52/">Maximum Circuit Lower Bounds for Exponential-Time Arthur Merl
 in</a>\nby Jingxun Liang (CMU) as part of Online Complexity Seminar\n\nAbs
 tract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/52/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Valentine Kabanets (SFU)
DTSTART:20250905T160000Z
DTEND:20250905T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/53
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/53/">Chain Rules for Time-Bounded Kolmogorov Complexity</a>\nby Va
 lentine Kabanets (SFU) as part of Online Complexity Seminar\n\nAbstract: T
 BA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/53/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mikito Nanashima (Institute of Science Tokyo)
DTSTART:20250911T100000Z
DTEND:20250911T113000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/54
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/54/">Complexity-Theoretic Inductive Inference</a>\nby Mikito Nanas
 hima (Institute of Science Tokyo) as part of Online Complexity Seminar\n\n
 Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/54/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bruno Cavalar (University of Oxford)
DTSTART:20250820T160000Z
DTEND:20250820T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/55
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/55/">Monotone Circuit Complexity of Matching</a>\nby Bruno Cavalar
  (University of Oxford) as part of Online Complexity Seminar\n\nAbstract: 
 TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/55/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Davi Castro-Silva (University of Cambridge)
DTSTART:20251023T160000Z
DTEND:20251023T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/56
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/56/">Algorithmic Polynomial Freiman-Ruzsa Theorems</a>\nby Davi Ca
 stro-Silva (University of Cambridge) as part of Online Complexity Seminar\
 n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/56/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ted Pyne (MIT)
DTSTART:20251120T170000Z
DTEND:20251120T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/57
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/57/">Composing Low-Space Algorithms</a>\nby Ted Pyne (MIT) as part
  of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/57/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jiatu Li (MIT)
DTSTART:20251204T170000Z
DTEND:20251204T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/58
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/58/">On the Time Complexity of Feasible Proofs</a>\nby Jiatu Li (M
 IT) as part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/58/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nathan Sheffield (MIT)
DTSTART:20260409T160000Z
DTEND:20260409T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/59
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/59/">The Structure of In-Place Space-Bounded Computation</a>\nby N
 athan Sheffield (MIT) as part of Online Complexity Seminar\n\nAbstract: TB
 A\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/59/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amik Raj Behera (University of Copenhagen)
DTSTART:20260319T170000Z
DTEND:20260319T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/60
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/60/">The PCP Theorem with a Single Composition</a>\nby Amik Raj Be
 hera (University of Copenhagen) as part of Online Complexity Seminar\n\nAb
 stract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/60/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hanlin Ren (IAS Princeton)
DTSTART:20260326T170000Z
DTEND:20260326T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/61
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/61/">Hardness of Range Avoidance and Proof Complexity Generators f
 rom Demi-Bits</a>\nby Hanlin Ren (IAS Princeton) as part of Online Complex
 ity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/61/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Surya Mathialagan (NTT Research)
DTSTART:20260422T160000Z
DTEND:20260422T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/62
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/62/">SNARGs for NP from Unprovability of Mathematical Theorems</a>
 \nby Surya Mathialagan (NTT Research) as part of Online Complexity Seminar
 \n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/62/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zeyong Li (National University of Singapore)
DTSTART:20260312T170000Z
DTEND:20260312T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/63
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/63/">Range Avoidance\, Arthur-Merlin\, and TFNP</a>\nby Zeyong Li 
 (National University of Singapore) as part of Online Complexity Seminar\n\
 nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/63/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yichuan Wang (Tsinghua University)
DTSTART:20260416T160000Z
DTEND:20260416T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/64
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/64/">Superquadratic Lower Bounds for Depth-2 Linear Threshold Circ
 uits</a>\nby Yichuan Wang (Tsinghua University) as part of Online Complexi
 ty Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/64/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Navid Talebanfard (University of Sheffield)
DTSTART:20260305T170000Z
DTEND:20260305T183000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/65
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/65/">Depth-Three Circuits: Recent Constructions and Lower Bounds\,
  and the Road Ahead</a>\nby Navid Talebanfard (University of Sheffield) as
  part of Online Complexity Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/65/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yotam Dikstein (IAS Princeton)
DTSTART:20260430T160000Z
DTEND:20260430T173000Z
DTSTAMP:20260422T225840Z
UID:COMPLEXITY-MEETINGS/66
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/COMPLEXITY-M
 EETINGS/66/">High Rate Efficient Local List Decoding from HDX</a>\nby Yota
 m Dikstein (IAS Princeton) as part of Online Complexity Seminar\n\nAbstrac
 t: TBA\n
LOCATION:https://researchseminars.org/talk/COMPLEXITY-MEETINGS/66/
END:VEVENT
END:VCALENDAR