On repetition-free Boolean functions over pre-elementary monotone bases
From MaRDI portal
Publication:3225872
Recommendations
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- Realization of Boolean functions by repetition-free formulas in a particular base
- On realization of Boolean functions by repetition-free formulas
- Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
- scientific article; zbMATH DE number 2047490
Cites work
Cited in
(10)- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
- scientific article; zbMATH DE number 7300360 (Why is no real title available?)
- Realization of Boolean functions by repetition-free formulas in a particular base
- Asymptotics of the number of repetition-free Boolean functions in the elementary basis
- On the length of a read-many certificate in certain extended elementary bases
- scientific article; zbMATH DE number 219938 (Why is no real title available?)
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- scientific article; zbMATH DE number 1855658 (Why is no real title available?)
- Read-once functions of the algebra of logic in pre-elementary bases
- On realization of Boolean functions by repetition-free formulas
This page was built for publication: On repetition-free Boolean functions over pre-elementary monotone bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225872)
