Applications of a Subset Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems(Algorithms : Mathematical Foundations and Applications)
スポンサーリンク
概要
著者
-
宮川 正弘
Tsukuba College Of Technology
-
宮川 正弘
Electrotechnical Laboratory
-
Stojmenovic Ivan
Institute of Mathematics, University of Novi Sad
-
Stojmenovic Ivan
Institute Of Mathematics University Of Novi Sad
関連論文
- A Map from the Lower-Half of the n-Cube onto the (n-1)-Cube which Preserves Intersecting Antichains
- Complexity of decision trees for Boolean operators : a shortened version
- Semirigid sets of clones of quasi-linear functions over a finite domain
- The number of orthogonal permutations
- Three Criteria for Selecting Variables in the Construction of Near-Optimal Decision Trees
- S-bases of Boolean Functions Under Several Functional Constructions : A Survey
- On the number of clique Boolean functions
- Construction of Efficient Decision Trees
- Applications of a Subset Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems(Algorithms : Mathematical Foundations and Applications)
- Classifications and Base Enumerations of the Maximal Sets of Three-Valued Logical Functions(Algorithms : Mathematical Foundations and Applications)