Binary representations of finite fields are defined as an injective mapping from a finite field to l-tuples with components in Ν0, 1Ν where 0 and 1 are elements of the field itself. This permits one to study the algebraic complexity of a particular binary representation, i.e., the minimum number of
Transformational methods and their application to complexity problems
β Scribed by Burkhard Monien
- Publisher
- Springer-Verlag
- Year
- 1976
- Tongue
- English
- Weight
- 764 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The application of Fourier transform methods in elasticity problems is discussed. An example of a half-apace with the external load extending to infinity is chosen to illustrate the problem that Fourier transforms cannot be obtained in a strict mathematical sense. Two different, possible method8 of
## Abstract The lattice structure often is employed in the representation of the knowledge and the search space as a method to represent the combinatorial relations of concepts, attributes, conditions and facts. In the information processing based on the lattice structure, often it is required to s