Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2019, Volume 31, Issue 2, Pages 34–56
DOI: https://doi.org/10.4213/dm1540 (Mi dm1540) 		 
This article is cited in 5 scientific papers (total in 5 papers)

Attribute-efficient learning of Boolean functions from Post closed classes

A. V. Bistrigova

Lomonosov Moscow State University
Full-text PDF (966 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1540
Abstract: We consider exact attribute-efficient learning of functions from Post closed classes using membership queries and obtain bounds on learning complexity.
Keywords: exact learning, attribute-efficient learning, membership queries, Post lattice of closed classes, binary covering array.
Received: 01.05.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 5, Pages 285–301
DOI: https://doi.org/10.1515/dma-2020-0025
Bibliographic databases:
Document Type: Article
UDC: 519.716.5
Language: Russian
Citation: A. V. Bistrigova, “Attribute-efficient learning of Boolean functions from Post closed classes”, Diskr. Mat., 31:2 (2019), 34–56; Discrete Math. Appl., 30:5 (2020), 285–301
Citation in format AMSBIB
\Bibitem{Bis19}
\by A.~V.~Bistrigova
\paper Attribute-efficient learning of Boolean functions from Post closed classes
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 2
\pages 34--56
\mathnet{http://mi.mathnet.ru/dm1540}
\crossref{https://doi.org/10.4213/dm1540}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3962499}
\elib{https://elibrary.ru/item.asp?id=37652127}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 5
\pages 285--301
\crossref{https://doi.org/10.1515/dma-2020-0025}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000582465000001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85094911446}
Linking options:
  • https://www.mathnet.ru/eng/dm1540
  • https://doi.org/10.4213/dm1540
  • https://www.mathnet.ru/eng/dm/v31/i2/p34
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:400
    Full-text PDF :45
    References:49
    First page:31
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024