Algorithms for constructing the shortest allowable partitions of finite sets

MaRDI QIDQ5146089zbMATHFDO

Authors L. N. Andreeva

Publication date 25 January 2021

Full work available at URL http://mathnet.ru/eng/pdm62

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Synthesis of discrete circuits in a PLD basis
• On the complexity of some partition problems
• An efficient algorithm for a special case of the set partition problem
• On realization of partitions of sets by circuits of functional elements
• Optimal Set Partitioning

Cites work

• scientific article; zbMATH DE number 3555919 (Why is no real title available?)
• Covering logical ciruits by modules of some commercially produced systems
• Error estimation of two approximate partitioning algorithms
• On the complexity of some partition problems

Cited in

(7)

• Synthesis of discrete circuits in a PLD basis
• Structural, Syntactic, and Statistical Pattern Recognition
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• On realization of partitions of sets by circuits of functional elements
• Algorithmic construction of sets for k -restrictions
• scientific article; zbMATH DE number 5812481 (Why is no real title available?)
• An insertion algorithm on multiset partitions with applications to diagram algebras

This page was built for publication: Algorithms for constructing the shortest allowable partitions of finite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146089)