Article
Licensed
Unlicensed
Requires Authentication
Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
-
I. O. SOKOLOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1995
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On combinatorial vector optimization problems
- Computation of discrete logarithms in an arbitrary finite field
- On a one-dimensional interval search problem
- Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
- An approach to the statistical estimation of population size
- Decomposable statistics in inverse urn problems
- The probability of consistency of systems of random Boolean equations
Articles in the same Issue
- On combinatorial vector optimization problems
- Computation of discrete logarithms in an arbitrary finite field
- On a one-dimensional interval search problem
- Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
- An approach to the statistical estimation of population size
- Decomposable statistics in inverse urn problems
- The probability of consistency of systems of random Boolean equations
