RUS  ENG
Full version
PEOPLE

Bienvenu Laurent

Presentations in Math-Net.Ru

  1. Deep effectively closed sets
    L. Bienvenu
    Kolmogorov seminar on computational complexity and descriptive complexity
    December 2, 2013 16:45
  2. The power and limitations of probabilistic algorithms in constructive mathematics
    L. Bienvenu
    Globus Seminar
    November 28, 2013 15:40   
  3. Deep effectively closed sets
    L. Bienvenu
    Kolmogorov seminar on computational complexity and descriptive complexity
    October 14, 2013 16:45


© Steklov Math. Inst. of RAS, 2024