Intelligent systems. Theory and applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find




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

Intelligent systems. Theory and applications, 2015, Volume 19, Issue 3, Pages 101–126 (Mi ista199)  
Part 3. Mathematical models

Complexity of learning linear boolean functions

A. V. Bistrigova
Full-text PDF (766 kB)
References:
PDF
HTML
Abstract: The exact learning of a linear Boolean function of $k$ relevant variables is considered in this work. Here we obtain the complexity of learning such functions for $k < 4$ and upper bounds for other values of $k$.
Keywords: linear Boolean functions, exact learning.
Document Type: Article
Language: Russian
Citation: A. V. Bistrigova, “Complexity of learning linear boolean functions”, Intelligent systems. Theory and applications, 19:3 (2015), 101–126
Citation in format AMSBIB
\Bibitem{Bis15}
\by A.~V.~Bistrigova
\paper Complexity of learning linear boolean functions
\jour Intelligent systems. Theory and applications
\yr 2015
\vol 19
\issue 3
\pages 101--126
\mathnet{http://mi.mathnet.ru/ista199}
Linking options:
  • https://www.mathnet.ru/eng/ista199
  • https://www.mathnet.ru/eng/ista/v19/i3/p101
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025