HomeIssuesAlgorithm for searching prohibitions of boolean functions

Algorithm for searching prohibitions of boolean functions | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).

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.
Download file
Counter downloads: 211
  • Title Algorithm for searching prohibitions of boolean functions
  • Headline Algorithm for searching prohibitions of boolean functions
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 6 (Приложение)
  • Date:
  • DOI
Keywords
запрет булевой функции, граф де Брёйна, prohibition of Boolean function, de Bruijn graph
Authors
References
Algorithm for searching prohibitions of boolean functions | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).
Algorithm for searching prohibitions of boolean functions | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).
Download full-text version
Counter downloads: 1888
Download file