Doklady Akademii Nauk
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


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk, 1994, Volume 335, Number 3, Pages 300–303 (Mi dan4856)  
COMPUTER SCIENCE

Algorithmic complexity of the generation of hypotheses and classifications based on the search for set intersections

S. O. Kuznetsov

All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences, Moscow
Full-text PDF (362 kB)
Presented: A. A. Dorodnitsyn
Received: 22.06.1993
Bibliographic databases:
Document Type: Article
UDC: 519.68:007.5
Language: Russian
Citation: S. O. Kuznetsov, “Algorithmic complexity of the generation of hypotheses and classifications based on the search for set intersections”, Dokl. Akad. Nauk, 335:3 (1994), 300–303; Dokl. Math., 39:3 (1994), 142–145
Citation in format AMSBIB
\Bibitem{Kuz94}
\by S.~O.~Kuznetsov
\paper Algorithmic complexity of the generation of hypotheses and
classifications based on the search for set intersections
\jour Dokl. Akad. Nauk
\yr 1994
\vol 335
\issue 3
\pages 300--303
\mathnet{http://mi.mathnet.ru/dan4856}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1288850}
\zmath{https://zbmath.org/?q=an:0939.68940}
\transl
\jour Dokl. Math.
\yr 1994
\vol 39
\issue 3
\pages 142--145
Linking options:
  • https://www.mathnet.ru/eng/dan4856
  • https://www.mathnet.ru/eng/dan/v335/i3/p300
    • 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