scientific article; zbMATH DE number 2047490
From MaRDI portal
Publication:4451647
zbMATH Open1034.06014MaRDI QIDQ4451647FDOQ4451647
Authors: O. V. Zubkov 
Publication date: 29 February 2004
Title of this publication is not available (Why is that?)
Recommendations
- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
- Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)
- Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
- The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)
- Realization of Boolean functions by repetition-free formulas in a particular base
Cited In (11)
- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
- On repetition-free Boolean functions over pre-elementary monotone bases
- The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)
- On realization of Boolean functions by repetition-free formulas
- Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.
- Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
- Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number
- Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451647)
