Algorithms for constructing the shortest allowable partitions of finite sets

zbMATH Open1468.68334MaRDI QIDQ5146089FDOQ5146089

Authors: L. N. Andreeva 

Publication date: 25 January 2021

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

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

Mathematics Subject Classification ID

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

Cites Work

• On the complexity of some partition problems
• Error estimation of two approximate partitioning algorithms
• Covering logical ciruits by modules of some commercially produced systems
• Title not available (Why is that?)

Cited In (6)

• Synthesis of discrete circuits in a PLD basis
• Title not available (Why is that?)
• Structural, Syntactic, and Statistical Pattern Recognition
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Algorithmic construction of sets for k -restrictions
• 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)