Anastasiya Chistopolskaya, Vladimir V. Podolskii, “On the Decision Tree Complexity of Threshold Functions”, Theory of Computing Systems, 2022, Volume 66, Pages 1074

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, 2022, Volume 66, Pages 1074–1098
DOI: https://doi.org/10.1007/s00224-022-10084-x (Mi tcs4)

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

On the Decision Tree Complexity of Threshold Functions

Anastasiya Chistopolskaya^a, Vladimir V. Podolskii^b

^a HSE University, Moscow, Russia
^b Steklov Mathematical Institute, Moscow, Russia

Citations (1)

DOI: https://doi.org/10.1007/s00224-022-10084-x

Funding agency	Grant number
Russian Science Foundation	21-11-00318
HSE Basic Research Program
The results presented in Section 3 are supported by Russian Science Foundation (21-11-00318). The results presented in Section 4 were prepared within the framework of the HSE University Basic Research Program. The preliminary version of the paper has appeared in the proceedings of CSR 2020 conference.

Accepted: 04.05.2022

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

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

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

Statistics & downloads:
Abstract page:	41