Loading [MathJax]/jax/output/CommonHTML/jax.js
Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Matematicheskie Zametki, 1975, Volume 18, Issue 1, Pages 137–150 (Mi mzm7635)  
This article is cited in 3 scientific papers (total in 3 papers)

Complexity of tests checking the operation of logic diagram inputs

V. N. Noskov

Institute of Mathematics, Academy of Sciences of the USSR, Siberian Branch
Full-text PDF (1154 kB) Citations (3)
Abstract: Exact upper bounds for the complexity of absolute tests checking the correctness of inputs of logic diagrams realizing Boolean functions which are essentially dependent on n variables have been found for n⩾136.
Received: 06.11.1973
English version:
Mathematical Notes, 1975, Volume 18, Issue 1, Pages 664–670
DOI: https://doi.org/10.1007/BF01461151
Bibliographic databases:
UDC: 519.95
Language: Russian
Citation: V. N. Noskov, “Complexity of tests checking the operation of logic diagram inputs”, Mat. Zametki, 18:1 (1975), 137–150; Math. Notes, 18:1 (1975), 664–670
Citation in format AMSBIB
\Bibitem{Nos75}
\by V.~N.~Noskov
\paper Complexity of tests checking the operation of logic diagram inputs
\jour Mat. Zametki
\yr 1975
\vol 18
\issue 1
\pages 137--150
\mathnet{http://mi.mathnet.ru/mzm7635}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=471442}
\zmath{https://zbmath.org/?q=an:0318.94030}
\transl
\jour Math. Notes
\yr 1975
\vol 18
\issue 1
\pages 664--670
\crossref{https://doi.org/10.1007/BF01461151}
Linking options:
  • https://www.mathnet.ru/eng/mzm7635
  • https://www.mathnet.ru/eng/mzm/v18/i1/p137
    • This publication is cited in the following 3 articles:
    1. Manuel S. Lazo-Cortés, José Fco. Martínez-Trinidad, Jesús A. Carrasco-Ochoa, Guillermo Sanchez-Diaz, “On the relation between rough set reducts and typical testors”, Information Sciences, 294 (2015), 152  crossref
    2. V. B. Kudryavtsev, A. E. Andreev, “Test recognition”, J. Math. Sci., 169:4 (2010), 457–480  mathnet  crossref  mathscinet
    3. V. B. Kudryavtsev, “Test recognition theory”, Discrete Math. Appl., 16:4 (2006), 319–350  mathnet  crossref  crossref  mathscinet  zmath  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:286
    Full-text PDF :119
    First page:1
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025