( en | de | ru )

 

Disambiguation of "Podolskii, Vladimir V."

Author of the publication

copydeleteadd this publication to your clipboard
On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom.

, , , and . Description Logics, volume 1879 of CEUR Workshop Proceedings, CEUR-WS.org, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

V Saile

V Geoffroy

V Wittwer

V Ustinov

V Adams

 

Other publications of authors with the same name

Constant-Depth Sorting Networks., , and . CoRR, (2022)A Uniform Lower Bound on Weights of Perceptrons.. CSR, volume 5010 of Lecture Notes in Computer Science, page 261-272. Springer, (2008)Weights of Exact Threshold Functions., , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 66-77. Springer, (2010)Tropical Combinatorial Nullstellensatz and Fewnomials Testing., and . FCT, volume 10472 of Lecture Notes in Computer Science, page 284-297. Springer, (2017)Logical Languages Accepted by Transformer Encoders with Hard Attention., , , and . ICLR, OpenReview.net, (2024)Patience of Matrix Games, , , and . CoRR, (2012)Circuit Complexity Meets Ontology-Based Data Access.. CSR, volume 9139 of Lecture Notes in Computer Science, page 7-26. Springer, (2015)Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results., , and . LICS, page 317-328. IEEE Computer Society, (2015)Multiparty Karchmer - Wigderson Games and Threshold Circuits., and . CCC, volume 169 of LIPIcs, page 24:1-24:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates., and . Electron. Colloquium Comput. Complex., (2016)