On the Boolean functions without upper bijunctive analogues
From MaRDI portal
Recommendations
- On a method for constructing low-weight Boolean functions without majorants of the given number of variables
- Bijunctive Boolean functions, graphs of 2-CNF and their order functions. Estimates of weight of a bijunctive function with a given number of layers
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On the weights of Boolean functions representable by 2-CNF or 3-CNF
- О методах оценивания веса булевых биюнктивных функций
Cites work
Cited in
(13)- Properties of Boolean functions without three-argument implicents
- Boolean functions without prediction
- On a method for constructing low-weight Boolean functions without majorants of the given number of variables
- Investigation of some subclasses of multiaffine, bijunctive, weakly positive and weakly negative Boolean functions
- On the weights of Boolean functions representable by 2-CNF or 3-CNF
- Bijunctive Boolean functions, graphs of 2-CNF and their order functions. Estimates of weight of a bijunctive function with a given number of layers
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On the number of bijunctive functions invariant with respect to a given permutation
- On realization of Boolean functions by formulae without repetitions
- Universal algebras generated by sets of satisfying vectors of bijunctive and r-junctive Boolean functions
- Properties of generator systems of universal algebras generated by Boolean bijunctive functions
- Computation of the additivity coefficient of some bijunctive, weakly positive and weakly negative Boolean functions
- On Boolean Functions Defined on Bracket Sequences
This page was built for publication: On the Boolean functions without upper bijunctive analogues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959064)
