Trudy po Diskretnoi Matematike
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Trudy po Diskretnoi Matematike, 2002, Volume 5, Pages 227–234 (Mi tdm85)  
This article is cited in 2 scientific papers (total in 2 papers)

Efficient algorithms for construction of general solution graph for systems of Boolean equations

V. G. Smirnov
Full-text PDF (570 kB) Citations (2)
Language: Russian
Citation: V. G. Smirnov, “Efficient algorithms for construction of general solution graph for systems of Boolean equations”, Tr. Diskr. Mat., 5, Fizmatlit, Moscow, 2002, 227–234
Citation in format AMSBIB
\Bibitem{Smi02}
\by V.~G.~Smirnov
\paper Efficient algorithms for construction of general solution graph for systems of Boolean equations
\serial Tr. Diskr. Mat.
\yr 2002
\vol 5
\pages 227--234
\publ Fizmatlit
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tdm85}
Linking options:
  • https://www.mathnet.ru/eng/tdm85
  • https://www.mathnet.ru/eng/tdm/v5/p227
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:656
    Full-text PDF :305
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024