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, 1994, Volume 6, Issue 2, Pages 43–73 (Mi dm627)  
This article is cited in 5 scientific papers (total in 5 papers)

On the complexity of Boolean matrices, graphs and their corresponding Boolean functions

A. V. Chashkin
Full-text PDF (3320 kB) Citations (5)
Received: 27.10.1992
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “On the complexity of Boolean matrices, graphs and their corresponding Boolean functions”, Diskr. Mat., 6:2 (1994), 43–73; Discrete Math. Appl., 4:3 (1994), 229–257
Citation in format AMSBIB
\Bibitem{Cha94}
\by A.~V.~Chashkin
\paper On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
\jour Diskr. Mat.
\yr 1994
\vol 6
\issue 2
\pages 43--73
\mathnet{http://mi.mathnet.ru/dm627}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1290406}
\zmath{https://zbmath.org/?q=an:0925.68334}
\transl
\jour Discrete Math. Appl.
\yr 1994
\vol 4
\issue 3
\pages 229--257
Linking options:
  • https://www.mathnet.ru/eng/dm627
  • https://www.mathnet.ru/eng/dm/v6/i2/p43
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:758
    Full-text PDF :562
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024