Persons: Podolskii, Vladimir Vladimirovich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Podolskii, Vladimir Vladimirovich

Total publications:	49 (47)
in MathSciNet:	34 (32)
in zbMATH:	23 (22)
in Web of Science:	31 (30)
in Scopus:	39 (39)
Cited articles:	27
Citations:	198
Presentations:	44

Number of views:
This page:	8128
Abstract pages:	5772
Full texts:	1050
References:	272

Doctor of physico-mathematical sciences (2021)

E-mail:

Website:

https://www.mi.ras.ru/~podolskii

Subject:

Computational complexity theory.

https://www.mathnet.ru/eng/person47204

https://scholar.google.com/citations?user=56S9XEsAAAAJ&hl=en

https://zbmath.org/authors/ai:podolskii.vladimir-v

https://mathscinet.ams.org/mathscinet/MRAuthorID/864796

https://www.webofscience.com/wos/author/record/K-1430-2015

https://www.scopus.com/authid/detail.url?authorId=23092161300

List of publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)


2023
1.	Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii, “Constant-Depth Sorting Networks”, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Leibniz Internat. Proc. in Inform., 251, 2023, 43 , 19 pp. ;

2022
2.	Anastasiya Chistopolskaya, Vladimir V. Podolskii, “On the Decision Tree Complexity of Threshold Functions”, Theory Comput. Syst., 66 (2022), 1074–1098 ;	1 ^[x]
3.	Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev, “A tetrachotomy of ontology-mediated queries with a covering axiom”, Artif. Intell., 309 (2022), 103738 , 46 pp. ;	1 ^[x]
4.	Vladimir Podolskii, Nikolay V. Proskurin, “Polynomial threshold functions for decision lists”, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz Internat. Proc. in Inform., 248, 2022, 52:1–52:12 ;
5.	Alexander Kozachinskiy, Vladimir Podolskii, “Multiparty Karchmer–Wigderson games and threshold circuits”, Theory Comput., 18 (2022), 15 , 33 pp. ;

2021
6.	L. Babai, K. A. Hansen, V. V. Podolskii, Xiaoming Sun, “Weights of exact threshold functions”, Izv. Math., 85:6 (2021), 1039–1059
7.	V. S. Atabekyan, L. D. Beklemishev, V. M. Buchstaber, S. S. Goncharov, V. S. Guba, Yu. L. Ershov, V. V. Kozlov, I. G. Lysenok, S. P. Novikov, Yu. S. Osipov, M. R. Pentus, V. V. Podolskii, A. A. Razborov, V. A. Sadovnichii, A. L. Semenov, A. L. Talambutsa, D. V. Treschev, L. N. Shevrin, “Sergei Ivanovich Adian (obituary)”, Russian Math. Surveys, 76:1 (2021), 177–181

2020
8.	Fedor V. Fomin, Vladimir V. Podolskii, “CSR 2018 Special Issue on TOCS”, Theory Comput. Syst., 64 (2020), 1–2 ;
9.	Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev, “A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom”, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, IJCAI Organization, 2020, 403–413	1 ^[x]
10.	Alexander Kozachinskiy, Vladimir Podolski, “Multiparty Karchmer – Wigderson Games and Threshold Circuits”, 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany, Leibniz Internat. Proc. in Inform., 169, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, 24 , 23 pp. ;
11.	Anastasiya Chistopolskaya, Vladimir V. Podolskii, “On the Decision Tree Complexity of Threshold Functions”, Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Lecture Notes in Comput. Sci., 12159, Springer, Cham, 2020, 198–210 ;
12.	Dima Grigoriev, Vladimir V. Podolskii, “Tropical Combinatorial Nullstellensatz and sparse polynomials”, Found. Comput. Math., 20 (2020), 753–781 ;	4 ^[x]
13.	Vladimir V. Podolskii, Alexander A. Sherstov, “Inner Product and Set Disjointness: Beyond Logarithmically Many Parties”, ACM Trans. Comput. Theory, 12:4 (2020), 26 , 28 pp. ;

2019
14.	Alexander S. Kulikov, Vladimir V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, Theory Comput. Syst., 63:5 (2019), 956–986
15.	A. S. Kulikov, I. Mikhailin, A. Mokhov, V. V. Podolskii, “Complexity of Linear Operators”, 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai University of Finance and Economics, in ShanghaiShanghai; China; 8 December 2019 – 11 December 2019, Leibniz Internat. Proc. in Inform., 149, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019, 17, 1–12 ;

2018
16.	Dima Grigoriev, Vladimir V. Podolskii, “Tropical effective primary and dual nullstellensätze”, Discrete Comput. Geom., 59:3 (2018), 507–552	8 ^[x]
17.	Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity”, Journal of the ACM, 65:5 (2018), 28 , 51 pp.	14 ^[x]
18.	Fedor V. Fomin, Vladimir V. Podolskii (eds.), Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings, Lecture Notes in Computer Science 10846, Springer, 2018 https://link.springer.com/book/10.1007

2017
19.	Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493	1 ^[x]
20.	M. Bienvenu, S. Kikot, R. Kontchakov, V. V. Podolskii, V. Ryzhikov, M. Zakharyaschev, “The complexity of ontology-based data access with OWL2QL and bounded treewidth queries”, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Volume Part F127745, 9 May 2017 (Chicago, United States, 14 May 2017 do 19 May 2017, Kod 127745), 2017, 201–216	5 ^[x]
21.	O. A. Gerasimova, S. P. Kikot, V. V. Podolskii, M. Zakharyaschev, “More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom”, International Conference on Knowledge Engineering and the Semantic Web KESW 2017: Knowledge Engineering and Semantic Web, Commun. Comput. Inf. Sci., 786, Springer, 2017, 143–158	3 ^[x]
22.	A. S. Kulikov, V. V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Leibniz Internat. Proc. in Inform., 66, no. 49, 2017, 1–14
23.	D. Yu. Grigor'ev, V. V. Podolskii, “Tropical Combinatorial Nullstellensatz and Fewnomials Testing”, International Symposium on Fundamentals of Computation Theory FCT 2017: Fundamentals of Computation Theory, Lecture Notes in Comput. Sci., 10472, Springer, 2017, 284–297	1 ^[x]
24.	O. Gerasimova, S. Kikot, V. Podolskii, M. Zakharyaschev, “On the data complexity of ontology-mediated queries with a covering axiom”, Proceedings of the 30th International Workshop on Description Logics (Montpellier, France, 18 July 2017 - 21 July 2017), CEUR Workshop Proceedings, 1879, CEUR-WS, 2017, 39 , 12 pp.

2016
25.	M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries” (Cape Town, South Africa, 22 April 2016 – 25 April 2016), CEUR Workshop Proceedings, 1577, 2016 , arXiv: 1604.05258

2015
26.	K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Inform. and Comput., 240 (2015), 56–73	11 ^[x]
27.	Dima Grigoriev, Vladimir V. Podolskii, “Complexity of tropical and min-plus linear prevarieties”, Comput. Complexity, 24:1 (2015), 31–64 http://www.mpim-bonn.mpg.de/preblob/5202, arXiv: 1204.4578	16 ^[x]
28.	D. Grigoriev, V. V. Podolskii, “Tropical effective primary and dual Nullstellensätze”, 32nd International Symposium on Theoretical Aspects of Computer Science, LIPIcs. Leibniz Int. Proc. Inform., 30, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015, 379–391
29.	V. V. Podolskii, “Circuit complexity meets ontology-based data access”, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings, Lecture Notes in Comput. Sci., 9139, 2015, 7–26 , arXiv: 1506.01296	1 ^[x]
30.	Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, 2015, 317–328	6 ^[x]

2014
31.	Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev, “The price of query rewriting in ontology-based data access”, Artificial Intelligence, 213 (2014), 42–59	41 ^[x]
32.	Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase”, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ACM Digital Library, 2014, 57:1–57:10 , arXiv: 1401.4420
33.	M. Bienvenu, S. Kikot, V. Podolskii, “Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries”, Description Logics 2014, CEUR Workshop Proceedings, 1193, 2014, 45–57 http://ceur-ws.org/Vol-1193/paper_43.pdf

2013
34.	V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, Log. Methods Comput. Sci., 9:2 (2013), 13 , 17 pp.	2 ^[x]
35.	K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Mathematical Foundations of Computer Science 2013, 38th International Symposium, MFCS 2013 (Klosterneuburg, Austria, August 26–30, 2013), Proceedings, Lecture Notes in Computer Science, 8087, Springer, Berlin–Heidelberg, 2013, 516–527 http://eccc.hpi-web.de/report/2013/021/	4 ^[x]
36.	S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Query Rewriting over Shallow Ontologies”, Description Logics 2013, Informal Proceedings of the 26th International Workshop on Description Logics (Ulm, Germany, July 23–26, 2013), CEUR Workshop Proceedings, 1014, 2013, 316–327
37.	K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. Tsigaridas, “Patience of matrix games”, Discrete Appl. Math., 161:16 (2013), 2440–2459

2012
38.	V. V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Inform. Process. Lett., 112:7 (2012), 267–271	2 ^[x]
39.	V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, How the World Computes, Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012 (Cambridge, UK, June 18–23, 2012), Proceedings, Lecture Notes in Comput. Sci., 7318, Springer–Berlin–Heidelberg, 2012, 599–608 , arXiv: 1204.2652	1 ^[x]
40.	K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. P. Tsigaridas, Patience of matrix games, 2012 , 32 pp., arXiv: 1206.1751
41.	S. Kikot, R. Kontchakov, V. V. Podolskii, M. Zakharyaschev, “Exponential lower bounds and separation for query rewriting”, Automata, Languages, and Programming, 39th International Colloquium, ICALP 2012 (Warwick, UK, July 9–13, 2012), Proceedings, Part II, Lecture Notes in Comput. Sci., 7392, Springer Berlin Heidelberg, 2012, 263–274 , arXiv: 1202.4193	20 ^[x]

2011
42.	Vladimir V. Podolskii, “Degree-uniform lower bound on the weights of polynomials with given sign function”, Proc. Steklov Inst. Math., 274 (2011), 231–246

2010
43.	V. V. Podolskii, A. A. Sherstov, “A Small Decrease in the Degree of a Polynomial with a Given Sign Function Can Exponentially Increase Its Weight and Length”, Math. Notes, 87:6 (2010), 860–873
44.	K. A. Hansen, V. V. Podolskii, “Exact threshold circuits”, Proc. of 25th Annual IEEE Conference on Computational Complexity (CCC), IEEE Computer Soc., Los Alamitos, CA, 2010, 270–279	13 ^[x]
45.	L. Babai, K. A. Hansen, V. Podolskii, Sun Xiaoming, “Weights of exact threshold functions”, Mathematical foundations of computer science 2010, Proc. of 35th International Symposium on Mathematical Foundations of Computer Science (MFCS) (Brno, Czech Republic, 2010), Lecture Notes in Comput. Sci., 6281, Springer, Berlin, 2010, 66–77	11 ^[x]

2009
46.	V. V. Podolskii, “Perceptrons of large weight”, Problems Inform. Transmission, 45:1 (2009), 46–53
47.	V. V. Podolskii, A. A. Sherstov, “Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length”, Russian Math. Surveys, 64:5 (2009), 950–951

2008
48.	V. V. Podolskii, “A uniform lower bound on weights of perceptrons”, Computer science—theory and applications, Lecture Notes in Comput. Sci., 5010, Springer, Berlin, 2008, 261–272	10 ^[x]

2007
49.	V. V. Podolskii, “Perceptrons of large weight”, Computer science — theory and applications, Proceedings of the Second International Symposium on Computer Science in Russia, CSR 2007 (Ekaterinburg, Russia, 2007), Lecture Notes in Comput. Sci., 4649, 2007, 328–336	2 ^[x]

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.	Макс-плюс многочлены и их корни V. V. Podolskii August 10, 2021 11:00
17.	Max-plus polynomials and their roots V. V. Podolskii Steklov Mathematical Institute Seminar January 21, 2021 16:00
18.	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
19.	Занятие 7. NP-полнота следующих задач: NAE-3-SAT, 3-COL, SUBSET-SUM, CLIQUE, VERTEX-COVER V. V. Podolskii Introduction to computational complexity theory November 3, 2020 16:15
20.	Занятие 6. Соотношение между классами P и P/poly. Задача CIRCUIT-SAT, ее NP-полнота. Задача 3-SAT, ее NP-полнота. Задача IND-SET, ее NP-полнота V. V. Podolskii Introduction to computational complexity theory October 27, 2020 16:15
21.	Занятие 5. Булевых схемы. Примеры: сложение, умножение, связность. Верхняя и нижняя оценки сложности вычисления булевых функций булевыми схемами V. V. Podolskii Introduction to computational complexity theory October 20, 2020 16:15
22.	Занятие 4. Класс NP, примеры. Соотношение с классами P и PSPACE. Недетерминированные машины Тьюринга, второе определение класса NP, эквивалентность определений. Полиномиальные сводимости, их основные свойства. NP-трудность и NP-полнота, их основные свойства V. V. Podolskii Introduction to computational complexity theory October 13, 2020 16:15
23.	Занятие 3. Теоремы об иерархии по времени и по памяти V. V. Podolskii Introduction to computational complexity theory October 6, 2020 16:15
24.	Занятие 2. Связь одноленточных и многоленточных машин Тьюринга. Универсальная машина Тьюринга. Вычисления с ограничением на время и память. Классы P, PSPACE, EXP. Примеры полиномиально вычислимых функций и полиномиально разрешимых языков V. V. Podolskii Introduction to computational complexity theory September 29, 2020 16:15
25.	Занятие 1. Машины Тьюринга, вычисление функций на машинах Тьюринга, лемма об очистке мусора, многоленточные машины Тьюринга V. V. Podolskii Introduction to computational complexity theory September 22, 2020 16:15
26.	Занятие 0. Устройство курса правила оценивания. Краткий обзор основ сложности вычислений. Классы с ограничением на память. Класс PSPACE, его свойства. Задача TQBF является PSPACE-полной. PSPACE=NPSPACE V. V. Podolskii Introduction to computational complexity theory September 15, 2020 16:15
27.	Макс-плюс многочлены и их корни V. V. Podolskii Knots and Representation Theory February 25, 2020 18:30
28.	Сложность вычисления некоторых функций коммуникационными протоколами с большим числом участников V. V. Podolskii Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic" December 24, 2018 17:30
29.	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
30.	Сложность вычисления некоторых функций коммуникационными протоколамис большим числом участников V. V. Podolskii "Algorithmic problems in algebra and logic" (S.I.Adian seminar) March 6, 2018 18:30
31.	О корнях многочленов в мин-плюс алгебре V. V. Podolskii "Algorithmic problems in algebra and logic" (S.I.Adian seminar) November 21, 2017 18:30
32.	Ontology-based data access meets circuit complexity V. V. Podolskii Applied Mathematics Day September 22, 2017 17:00
33.	Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates V. V. Podolskii MIPT Interdepartmental Seminar on Discrete Mathematics March 23, 2017 18:30
34.	Polynomials in min-plus algebra and related algorithmic problems V. V. Podolskii Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian July 19, 2016 15:50
35.	Оценки длин преобразований запросов к снабженным логической теорией базам данных V. V. Podolskii "Algorithmic problems in algebra and logic" (S.I.Adian seminar) December 1, 2015 18:30
36.	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
37.	Min-Plus polynomials and mean payoff games V. V. Podolskii Colloquium of the Faculty of Computer Science April 30, 2015 16:40
38.	Approximation of Boolean functions by polynomials V. V. Podolskii Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences April 2, 2015 16:00
39.	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
40.	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
41.	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
42.	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
43.	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
44.	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

Organisations

Registration to the website

Logotypes