Lecture Notes in Computer Science
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Lecture Notes in Computer Science, 2020, Volume 12159, Pages 198–210
DOI: https://doi.org/10.1007/978-3-030-50026-9_14 (Mi lncs42) 		 
On the Decision Tree Complexity of Threshold Functions

Anastasiya Chistopolskayaa, Vladimir V. Podolskiib

a National Research University Higher School of Economics, Moscow, Russia
b Steklov Mathematical Institute, Russian Academy of Sciences, Moscow, Russia
Full-text PDF
DOI: https://doi.org/10.1007/978-3-030-50026-9_14
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00822
National Research University Higher School of Economics
The paper is partially supported by RFBR Grant 18-01-00822 and by HSE University Basic Research Program.
Bibliographic databases:
Document Type: Article
Language: English
Linking options:
  • https://www.mathnet.ru/eng/lncs42
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025