Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 1981, Volume 17, Issue 1, Pages 108–112 (Mi ppi1386)  
Сorrespondence

Lower Bound on the Complexity of Discrimination of Two Statistical Hypotheses

K. Sh. Zigangirov
Full-text PDF (325 kB)
Abstract: The problem of discrimination of two statistical hypotheses by a finite-complexity automaton is considered. A lower bound on the automaton complexity is obtained, which depends on the required values of the first- and second-kind error probabilities.
Received: 25.09.1979
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.27
Language: Russian
Citation: K. Sh. Zigangirov, “Lower Bound on the Complexity of Discrimination of Two Statistical Hypotheses”, Probl. Peredachi Inf., 17:1 (1981), 108–112
Citation in format AMSBIB
\Bibitem{Zig81}
\by K.~Sh.~Zigangirov
\paper Lower Bound on the Complexity of Discrimination of Two Statistical Hypotheses
\jour Probl. Peredachi Inf.
\yr 1981
\vol 17
\issue 1
\pages 108--112
\mathnet{http://mi.mathnet.ru/ppi1386}
\zmath{https://zbmath.org/?q=an:0464.62010}
Linking options:
  • https://www.mathnet.ru/eng/ppi1386
  • https://www.mathnet.ru/eng/ppi/v17/i1/p108
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:172
    Full-text PDF :83
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024