Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory of Computing Systems, 2017, Volume 61, Issue 2, Pages 464

Theory of Computing Systems

RUS ENG

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

Theory of Computing Systems, 2017, Volume 61, Issue 2, Pages 464–493
DOI: https://doi.org/10.1007/s00224-016-9707-z (Mi tcs1)

This article is cited in 1 scientific paper (total in 1 paper)

Bounds in Ontology-Based Data Access via Circuit Complexity

Vladimir V. Podolskii

Steklov Mathematical Institute, Moscow, Russia

Full-text PDF Citations (1)

DOI: https://doi.org/10.1007/s00224-016-9707-z

Funding agency	Grant number
Russian Science Foundation	14-50-00005
This work is supported by the Russian Science Foundation under grant 14-50-00005 performed in Steklov Mathematical Institute of Russian Academy of Sciences.

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

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

Related presentations:

This publication is cited in the following 1 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles