Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14086| Title: | ON BASE ENUMERATION ALGORITHMS | Authors: | Stojmenovic I. Miyakawa M. |
Issue Date: | 1-Jan-1986 | Journal: | Denshi Gijutsu Sogo Kenkyusho Iho/Bulletin of the Electrotechnical Laboratory | Abstract: | Functional completeness theory of the set of k-valued logical functions P//k involves classifying functions of a closed set of P//k by using all of its maximal sets. This also divides all its bases into finite equivalence classes. This paper presents two algorithms for enumeration of the classes of bases and compares them. | URI: | https://open.uns.ac.rs/handle/123456789/14086 | ISSN: | 03669092 |
| Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.