Prikladnaya 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


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




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

Prikladnaya Diskretnaya Matematika, 2009, Number 2(4), Pages 56–78 (Mi pdm61)  
Theoretical Foundations of Applied Discrete Mathematics

Completeness problems for descrete functions

N. G. Parvatov

Tomsk State University, Tomsk, Russia
Full-text PDF (510 kB)
References:
PDF
HTML
Abstract: Completeness and expressability of functional systems are studied.
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: N. G. Parvatov, “Completeness problems for descrete functions”, Prikl. Diskr. Mat., 2009, no. 2(4), 56–78
Citation in format AMSBIB
\Bibitem{Par09}
\by N.~G.~Parvatov
\paper Completeness problems for descrete functions
\jour Prikl. Diskr. Mat.
\yr 2009
\issue 2(4)
\pages 56--78
\mathnet{http://mi.mathnet.ru/pdm61}
\elib{https://elibrary.ru/item.asp?id=13091779}
Linking options:
  • https://www.mathnet.ru/eng/pdm61
  • https://www.mathnet.ru/eng/pdm/y2009/i2/p56
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:281
    Full-text PDF :109
    References:56
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024