E-LIB Suche - Ergebnisse für: Podolskii, Vladimir V.

1

On the Decision Tree Complexity of Threshold Functions:

Chistopolskaya, Anastasiya ; Podolskii, Vladimir V.
Theory of Computing Systems. 66 (2022) 6 - p. 1074-1098 , 2022

Link: https://doi.org/10.1007/..

2

Deciding Boundedness of Monadic Sirups:

, In: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,

Kikot, Stanislav ; Kurucz, Agi ; Podolskii, Vladimir V.. - p. 370-387 , 2021

Link: https://dl.acm.org/doi/1..

3

Inner Product and Set Disjointness : Beyond Logarithmica..:

Podolskii, Vladimir V. ; Sherstov, Alexander A.
ACM Transactions on Computation Theory (TOCT). 12 (2020) 4 - p. 1-28 , 2020

Link: https://dl.acm.org/doi/1..

4

Inner Product and Set Disjointness: Beyond Logarithmically ..:

Podolskii, Vladimir V. ; Sherstov, Alexander A.
ACM Transactions on Computation Theory. 12 (2020) 4 - p. 1-28 , 2020

Link: https://doi.org/10.1145/..

5

On the Decision Tree Complexity of Threshold Functions:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,

Chistopolskaya, Anastasiya ; Podolskii, Vladimir V. - p. 198-210 , 2020

Link: https://doi.org/10.1007/..

6

CSR 2018 Special Issue on TOCS:

Fomin, Fedor V. ; Podolskii, Vladimir V.
Theory of Computing Systems. 64 (2019) 1 - p. 1-2 , 2019

Link: https://doi.org/10.1007/..

7

Tropical Combinatorial Nullstellensatz and Sparse Polynomia..:

Grigoriev, Dima ; Podolskii, Vladimir V.
Foundations of Computational Mathematics. 20 (2019) 4 - p. 753-781 , 2019

Link: https://doi.org/10.1007/..

8

Computer Science – Theory and Applications

13th International Computer Science Symposium in Russia, CS... Lecture Notes in Computer Science ; 10846;Theoretical Computer Science and General Issues ; 10846;SpringerLink, Bücher;Springer eBook Collection, Computer Science

Podolskii, Vladimir V. ; Fomin, Fedor V. , 2018

Link: https://doi.org/10.1007/..

9

Ontology-Mediated Queries: Combined Complexity and Succinct..:

Bienvenu, Meghyn ; Kikot, Stanislav ; Kontchakov, Roman..
Journal of the ACM. 65 (2018) 5 - p. 1-51 , 2018

Link: https://doi.org/10.1145/..

10

Tropical Effective Primary and Dual Nullstellensätze:

Grigoriev, Dima ; Podolskii, Vladimir V.
Discrete & Computational Geometry. 59 (2018) 3 - p. 507-552 , 2018

Link: https://doi.org/10.1007/..

11

Ontology-Mediated Queries : Combined Complexity and Succ..:

Bienvenu, Meghyn ; Kikot, Stanislav ; Kontchakov, Roman..
Journal of the ACM (JACM). 65 (2018) 5 - p. 1-51 , 2018

Link: https://dl.acm.org/doi/1..

12

Computing Majority by Constant Depth Majority Circuits with..:

Kulikov, Alexander S. ; Podolskii, Vladimir V.
Theory of Computing Systems. 63 (2018) 5 - p. 956-986 , 2018

Link: https://doi.org/10.1007/..

13

The Complexity of Ontology-Based Data Access with OWL 2 QL ..:

, In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,

Bienvenu, Meghyn ; Kikot, Stanislav ; Kontchakov, Roman... - p. 201-216 , 2017

Link: https://dl.acm.org/doi/1..

14

Bounds in Ontology-Based Data Access via Circuit Complexity:

Podolskii, Vladimir V.
Theory of Computing Systems. 61 (2016) 2 - p. 464-493 , 2016

Link: https://doi.org/10.1007/..

15

Polynomial threshold functions and Boolean threshold circui..:

Hansen, Kristoffer Arnsfelt ; Podolskii, Vladimir V.
Information and Computation. 240 (2015) - p. 56-73 , 2015

Link: https://doi.org/10.1016/..