×

zbMATH — the first resource for mathematics

Podol’skiĭ, Vladimir Vladimirovich

Compute Distance To:
Author ID: podolskii.vladimir-v Recent zbMATH articles by "Podol’skiĭ, Vladimir Vladimirovich"
Published as: Podolskii, Vladimir V.; Podolskii, Vladimir; Podolskii, V. V.; Podol’skii, V. V.
Homepage: http://www.mi.ras.ru/~podolskii
External Links: MGP · Math-Net.Ru
Documents Indexed: 30 Publications since 2007, including 1 Book

Publications by Year

Citations contained in zbMATH Open

19 Publications have been cited 65 times in 47 Documents Cited by Year
Complexity of tropical and MIN-plus linear prevarieties. Zbl 1326.15039
Grigoriev, Dima; Podolskii, Vladimir V.
9
2015
The price of query rewriting in ontology-based data access. Zbl 1390.68246
Gottlob, Georg; Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir; Schwentick, Thomas; Zakharyaschev, Michael
8
2014
Perceptrons of large weight. Zbl 1171.68585
Podolskii, V. V.
6
2009
Tropical effective primary and dual Nullstellensätze. Zbl 1356.14058
Grigoriev, Dima; Podolskii, Vladimir V.
5
2015
Computing majority by constant depth majority circuits with low fan-in gates. Zbl 1402.68100
Kulikov, Alexander S.; Podolskii, Vladimir V.
4
2017
Weights of exact threshold functions. Zbl 1287.94129
Babai, László; Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.; Sun, Xiaoming
4
2010
Exponential lower bounds and separation for query rewriting. Zbl 1367.68089
Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir; Zakharyaschev, Michael
4
2012
A uniform lower bound on weights of perceptrons. Zbl 1142.94400
Podolskii, Vladimir V.
4
2008
Tropical effective primary and dual Nullstellensätze. Zbl 1420.14140
Grigoriev, Dima; Podolskii, Vladimir V.
3
2018
On the succinctness of query rewriting over shallow ontologies. Zbl 1401.68316
Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir V.; Zakharyaschev, Michael
3
2014
Circuit complexity meets ontology-based data access. Zbl 1464.68096
Podolskii, Vladimir V.
2
2015
Polynomial threshold functions and Boolean threshold circuits. Zbl 1312.68088
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
2
2013
Tropical combinatorial nullstellensatz and fewnomials testing. Zbl 06810961
Grigoriev, Dima; Podolskii, Vladimir V.
2
2017
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity. Zbl 1426.68075
Bienvenu, Meghyn; Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir V.; Zakharyaschev, Michael
2
2018
Tree-like queries in OWL 2 QL: succinctness and complexity results. Zbl 1401.68058
Bienvenu, Meghyn; Kikot, Stanislav; Podolskii, Vladimir
2
2015
Exponential lower bound for bounded depth circuits with few threshold gates. Zbl 1237.68091
Podolskii, Vladimir V.
2
2012
Lower bound on weights of large degree threshold functions. Zbl 1297.68086
Podolskii, Vladimir V.
1
2013
Polynomial threshold functions and Boolean threshold circuits. Zbl 1312.68089
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
1
2015
Perceptrons of large weight. Zbl 1188.94053
Podolskii, Vladimir V.
1
2007
Tropical effective primary and dual Nullstellensätze. Zbl 1420.14140
Grigoriev, Dima; Podolskii, Vladimir V.
3
2018
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity. Zbl 1426.68075
Bienvenu, Meghyn; Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir V.; Zakharyaschev, Michael
2
2018
Computing majority by constant depth majority circuits with low fan-in gates. Zbl 1402.68100
Kulikov, Alexander S.; Podolskii, Vladimir V.
4
2017
Tropical combinatorial nullstellensatz and fewnomials testing. Zbl 06810961
Grigoriev, Dima; Podolskii, Vladimir V.
2
2017
Complexity of tropical and MIN-plus linear prevarieties. Zbl 1326.15039
Grigoriev, Dima; Podolskii, Vladimir V.
9
2015
Tropical effective primary and dual Nullstellensätze. Zbl 1356.14058
Grigoriev, Dima; Podolskii, Vladimir V.
5
2015
Circuit complexity meets ontology-based data access. Zbl 1464.68096
Podolskii, Vladimir V.
2
2015
Tree-like queries in OWL 2 QL: succinctness and complexity results. Zbl 1401.68058
Bienvenu, Meghyn; Kikot, Stanislav; Podolskii, Vladimir
2
2015
Polynomial threshold functions and Boolean threshold circuits. Zbl 1312.68089
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
1
2015
The price of query rewriting in ontology-based data access. Zbl 1390.68246
Gottlob, Georg; Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir; Schwentick, Thomas; Zakharyaschev, Michael
8
2014
On the succinctness of query rewriting over shallow ontologies. Zbl 1401.68316
Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir V.; Zakharyaschev, Michael
3
2014
Polynomial threshold functions and Boolean threshold circuits. Zbl 1312.68088
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
2
2013
Lower bound on weights of large degree threshold functions. Zbl 1297.68086
Podolskii, Vladimir V.
1
2013
Exponential lower bounds and separation for query rewriting. Zbl 1367.68089
Kikot, Stanislav; Kontchakov, Roman; Podolskii, Vladimir; Zakharyaschev, Michael
4
2012
Exponential lower bound for bounded depth circuits with few threshold gates. Zbl 1237.68091
Podolskii, Vladimir V.
2
2012
Weights of exact threshold functions. Zbl 1287.94129
Babai, László; Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.; Sun, Xiaoming
4
2010
Perceptrons of large weight. Zbl 1171.68585
Podolskii, V. V.
6
2009
A uniform lower bound on weights of perceptrons. Zbl 1142.94400
Podolskii, Vladimir V.
4
2008
Perceptrons of large weight. Zbl 1188.94053
Podolskii, Vladimir V.
1
2007

Citations by Year