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


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




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

Diskretnaya Matematika, 1998, Volume 10, Issue 1, Pages 46–62
DOI: https://doi.org/10.4213/dm407 (Mi dm407) 		 
Lower bounds for the complexity of systems of vectors of $k$-valued logic

A. V. Chashkin
Full-text PDF (1558 kB)
DOI: https://doi.org/10.4213/dm407
Abstract: Exact values of the complexity of generating narrow vector systems of $k$-valued logic by circuits over various bases are found. It is shown that lower bounds for the complexity of generating narrow vector systems that are asymptotically greater than the bounds obtained in this work imply exponential lower bounds for the complexity of functions of $k$-valued logic when they are realized by circuits over complete bases.
This research was supported by the Russian Foundation for Basic Research, grant 96–01–01068.
Received: 21.03.1996
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “Lower bounds for the complexity of systems of vectors of $k$-valued logic”, Diskr. Mat., 10:1 (1998), 46–62; Discrete Math. Appl., 8:1 (1998), 81–97
Citation in format AMSBIB
\Bibitem{Cha98}
\by A.~V.~Chashkin
\paper Lower bounds for the complexity of systems of vectors of $k$-valued logic
\jour Diskr. Mat.
\yr 1998
\vol 10
\issue 1
\pages 46--62
\mathnet{http://mi.mathnet.ru/dm407}
\crossref{https://doi.org/10.4213/dm407}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1669075}
\zmath{https://zbmath.org/?q=an:0965.03028}
\transl
\jour Discrete Math. Appl.
\yr 1998
\vol 8
\issue 1
\pages 81--97
Linking options:
  • https://www.mathnet.ru/eng/dm407
  • https://doi.org/10.4213/dm407
  • https://www.mathnet.ru/eng/dm/v10/i1/p46
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:324
    Full-text PDF :186
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024