Itsykson Dmitrii Mikhailovich

Presentations in Math-Net.Ru

1. Proof complexity lower bounds via communication arguments
   D. M. Itsykson
   General Mathematics Seminar of the St. Petersburg Division of Steklov Institute of Mathematics, Russian Academy of Sciences
   November 22, 2021 13:00   
2. Structural complexity of probabilistic algorithms for bounded-error
   D. M. Itsykson
   Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
   December 18, 2009 17:00