Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the complexity of realization of partial Boolean functions by circuits of functional elements
-
A. E. ANDREEV
Veröffentlicht/Copyright:
8. Oktober 2009
Published Online: 2009-10-08
Published in Print: 1991
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- The main trends in the theory of homogeneous structures
- On the complexity of realization of partial Boolean functions by circuits of functional elements
- On schemes permitting short single diagnostic tests
- Extremal problems for k-colour graphs and exact inequalities for pairs of random elements
- An upper bound of the cardinality of antichain boundary in the n-cube
- The number of components of a random bipartite graph
- On the random graph structure near the critical point
- On asymptotic estimation for stratified finite populations
- Multitype critical Galton-Watson branching process with final types
- Asymptotic normality of decomposable statistics on the frequencies of m-tuples
Artikel in diesem Heft
- The main trends in the theory of homogeneous structures
- On the complexity of realization of partial Boolean functions by circuits of functional elements
- On schemes permitting short single diagnostic tests
- Extremal problems for k-colour graphs and exact inequalities for pairs of random elements
- An upper bound of the cardinality of antichain boundary in the n-cube
- The number of components of a random bipartite graph
- On the random graph structure near the critical point
- On asymptotic estimation for stratified finite populations
- Multitype critical Galton-Watson branching process with final types
- Asymptotic normality of decomposable statistics on the frequencies of m-tuples