One more way for counting monotone Boolean functions


Бакоев, Валентин (2012) One more way for counting monotone Boolean functions Proc. of the XIII Intern. Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 15-21 June, 2012, Pomorie, Bulgaria, pp. 47-52. ISSN: 1313-423X; http://www.math.bas.bg/moiuser/~ACCT2012/b8.pdf


 We represent the outline of a new algorithm for counting the monotone Boolean functions of $n$ variables. It is a continuation of our previous investigation and results, related to this problem.
  Доклад
 Monotone Boolean functions, generating, counting, algorithm


Природни науки, математика и информатика
Природни науки, математика и информатика Информатика и компютърни науки

Natural sciences, mathematics and informatics
Natural sciences, mathematics and informatics Informatics and Computer Science

 Издадено
  5729
 Валентин Бакоев

4. • Frank a Campo, Relations between Powers of DedekindNumbers and Exponential Sums Related to Them, Journal of Integer Sequences, Vol. 21 (2018), Article 18.4.4. ISSN 1530-7638, Q2, SJR (2017) 0,57

2. Patrick De Causmaecker, Stefan De Wannemacker, Jay Yellen, Intervals of Antichains and Their Decompositions, arXiv:1602.04675v1 (http://arxiv.org/abs/1602.04675)

3. Tkachenco V.G., Sinyavsky O.V, Blocks of Monotone Boolean Functions of Rank 5, Computer Science and Information Technology 4(4): 139-146, 2016. (DOI: 10.13189/csit.2016.040402)

1. Patrick De Causmaecker, Stefan De Wannemacker, On the number of antichains of sets in a finite universe. arXiv:1407.4288v2; (http://arxiv.org/abs/1407.4288)

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/