Podolskii Vladimir Vladimirovich

Presentations in Math-Net.Ru

1. Majority circuits and sorting networks of small depth
   Vladimir Podolskii
   Fourth Workshop on Digitalization and Computable Models (WDCM-2022)
   October 26, 2022 17:00   
2. Weights of polynomial threshold functions
   V. V. Podolskii
   International Workshop “Approximation and Matrix Complexity”
   December 21, 2021 20:00   
3. Lecture 13. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   December 6, 2021 10:00   
4. Lecture 12. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   November 29, 2021 10:00   
5. Lecture 11. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   November 22, 2021 10:00   
6. Lecture 10. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   November 15, 2021 10:00   
7. Lecture 9. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   November 8, 2021 10:00   
8. Lecture 8. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   October 25, 2021 10:00   
9. Lecture 7. Introduction to computational complexity theory
   V. V. Podolskii
   Introduction to computational complexity theory
   October 18, 2021 10:00   
10. Lecture 6. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    October 11, 2021 10:00   
11. Lecture 5. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    October 4, 2021 10:00   
12. Lecture 4. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    September 27, 2021 10:00   
13. Lecture 3. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    September 20, 2021 10:00   
14. Lecture 2. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    September 13, 2021 10:00   
15. Lecture 1. Introduction to computational complexity theory
    V. V. Podolskii
    Introduction to computational complexity theory
    September 6, 2021 10:00   
16. Max-plus polynomials and their roots
    V. V. Podolskii
    Steklov Mathematical Institute Seminar
    January 21, 2021 16:00   
17. Max-plus polynomials and their roots
    V. V. Podolskii
    Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2020
    November 25, 2020 11:00   
18. Lower bounds for databases augmented with logical theories
    V. V. Podolskii
    Conference «Contemporary Mathematics and its applications» dedicated to the results of research supported by the Russian Science Foundation grant 14-50-00005
    November 19, 2018 15:10   
19. Ontology-based data access meets circuit complexity
    V. V. Podolskii
    Applied Mathematics Day
    September 22, 2017 17:00   
20. Bounds on the size of query rewritings in ontology based data access
    V. V. Podolskii
    Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2015
    November 11, 2015 11:45   
21. Min-Plus polynomials and mean payoff games
    V. V. Podolskii
    Colloquium of the Faculty of Computer Science
    April 30, 2015 16:40   
22. Approximation of Boolean functions by polynomials
    V. V. Podolskii
    Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences
    April 2, 2015 16:00   
23. On the analog of Hilbert's Nullstellensatz for polynomials in algebraic system $(\mathbb{R}, \min, +)$
    V. V. Podolskii
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    November 11, 2014 18:30
24. Threshold gates on the set $\{1,2\}$ and threshold circuits
    V. V. Podolskii
    Kolmogorov seminar on computational complexity and descriptive complexity
    April 1, 2013 16:45
25. On the analog of Hilbert's Nullstellensatz theorem in the algebraic system $(\mathbb{R}, \min, +)$
    V. V. Podolskii
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    March 26, 2013 18:30
26. On the representation of Boolean functions by sign functions of integer polynomials
    V. V. Podolskii
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    December 4, 2012 18:30
27. On equations in $(\mathbb{Z}, \min, +)$ algebraic system
    V. V. Podolskii
    "Algorithmic problems in algebra and logic" (S.I.Adian seminar)
    May 15, 2012 18:30
28. On some classes of Boolean schemes of bounded depth
    V. V. Podolskii
    Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
    December 18, 2009 16:00