Prikladnaya Diskretnaya Matematika. Supplement
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


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




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 123–125 (Mi pdma110)  
Computational methods in discrete mathematics

Algorithm for searching prohibitions of Boolean functions

D. V. Ryabokon

Tomsk State University
Full-text PDF (567 kB)
References:
PDF
HTML
Abstract: An algorithm for search of prohibitions of Boolean function based on the branch and bound method is proposed. It allows to find a prohibition of Boolean function, a prohibition of minimum length or all prohibitions under a specified length.
Keywords: prohibition of Boolean function, de Bruijn graph.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: D. V. Ryabokon, “Algorithm for searching prohibitions of Boolean functions”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 123–125
Citation in format AMSBIB
\Bibitem{Rya13}
\by D.~V.~Ryabokon
\paper Algorithm for searching prohibitions of Boolean functions
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 123--125
\mathnet{http://mi.mathnet.ru/pdma110}
Linking options:
  • https://www.mathnet.ru/eng/pdma110
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p123
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025