On repetition-free Boolean functions over pre-elementary monotone bases
From MaRDI portal
Publication:3225872
DOI10.1515/DMA.2009.016zbMATH Open1243.06011MaRDI QIDQ3225872FDOQ3225872
Authors: Ivan Konstantinovich Sharankhaev 
Publication date: 23 March 2012
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
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
residual functionspre-elementary basesrepetition-free formulasrepresentations of Boolean functions by formulas
Cites Work
Cited In (10)
- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
- On realization of Boolean functions by repetition-free formulas
- Read-once functions of the algebra of logic in pre-elementary bases
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the length of a read-many certificate in certain extended elementary bases
- Title not available (Why is that?)
- Realization of Boolean functions by repetition-free formulas in a particular base
- Criteria for a Boolean function to be a repetition-free in the pre-elementary bases of rank 3
- Asymptotics of the number of repetition-free Boolean functions in the elementary basis
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)
