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, 2015, Number 3(29), Pages 5–16
DOI: https://doi.org/10.17223/20710410/29/1 (Mi pdm511) 		 
Theoretical Foundations of Applied Discrete Mathematics

On lower bounds for complexity over infinite basises for functions of multi-valued logic

A. A. Andreev

Lomonosov Moscow State University, Moscow, Russia
Full-text PDF (625 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/29/1
Abstract: The complexity and the depth of multi-valued logic functions realization by formulas and by circuits of functional gates over infinite incomplete basises are estimated. Some examples of infinite basises allowing high (including overexponential) lower bounds for complexity are presented.
Keywords: functions of multi-valued logic, infinite basises, incomplete basises, overexponential complexity bounds, exponential depth bounds.
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. A. Andreev, “On lower bounds for complexity over infinite basises for functions of multi-valued logic”, Prikl. Diskr. Mat., 2015, no. 3(29), 5–16
Citation in format AMSBIB
\Bibitem{And15}
\by A.~A.~Andreev
\paper On lower bounds for complexity over infinite basises for functions of multi-valued logic
\jour Prikl. Diskr. Mat.
\yr 2015
\issue 3(29)
\pages 5--16
\mathnet{http://mi.mathnet.ru/pdm511}
\crossref{https://doi.org/10.17223/20710410/29/1}
Linking options:
  • https://www.mathnet.ru/eng/pdm511
  • https://www.mathnet.ru/eng/pdm/y2015/i3/p5
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:138
    Full-text PDF :53
    References:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024