IEICE TRANSACTIONS on transactions
Boolean-Function Representations of a Mapping
Summary :
This paper describes some representations of a mapping and their simplification. Any mapping from a finite set into another can be represented by a sequence of Boolean functinos if we encode its domain and range to finite binary sequences. The complexity of the representation depends on the encoding. We present a problem of finding an algorithm that derives one of the simplest representations of a given mapping, and solve it in a case where the complexity measure is determined according to the number of literals in disjunctive forms.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E65-E No.6 pp.337-344
- Publication Date
- 1982/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computers
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tsutomu MATSUMOTO, Hideki IMAI, "Boolean-Function Representations of a Mapping" in IEICE TRANSACTIONS on transactions,
vol. E65-E, no. 6, pp. 337-344, June 1982, doi: .
Abstract: This paper describes some representations of a mapping and their simplification. Any mapping from a finite set into another can be represented by a sequence of Boolean functinos if we encode its domain and range to finite binary sequences. The complexity of the representation depends on the encoding. We present a problem of finding an algorithm that derives one of the simplest representations of a given mapping, and solve it in a case where the complexity measure is determined according to the number of literals in disjunctive forms.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e65-e_6_337/_p
Copy
@ARTICLE{e65-e_6_337,
author={Tsutomu MATSUMOTO, Hideki IMAI, },
journal={IEICE TRANSACTIONS on transactions},
title={Boolean-Function Representations of a Mapping},
year={1982},
volume={E65-E},
number={6},
pages={337-344},
abstract={This paper describes some representations of a mapping and their simplification. Any mapping from a finite set into another can be represented by a sequence of Boolean functinos if we encode its domain and range to finite binary sequences. The complexity of the representation depends on the encoding. We present a problem of finding an algorithm that derives one of the simplest representations of a given mapping, and solve it in a case where the complexity measure is determined according to the number of literals in disjunctive forms.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Boolean-Function Representations of a Mapping
T2 - IEICE TRANSACTIONS on transactions
SP - 337
EP - 344
AU - Tsutomu MATSUMOTO
AU - Hideki IMAI
PY - 1982
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E65-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1982
AB - This paper describes some representations of a mapping and their simplification. Any mapping from a finite set into another can be represented by a sequence of Boolean functinos if we encode its domain and range to finite binary sequences. The complexity of the representation depends on the encoding. We present a problem of finding an algorithm that derives one of the simplest representations of a given mapping, and solve it in a case where the complexity measure is determined according to the number of literals in disjunctive forms.
ER -
English
