An efficient algorithm for a special case of the set partition problem

DOI10.1080/00207169008803858zbMath0699.68066OpenAlexW1977433435MaRDI QIDQ3477962

Alan Jackson, Prakash V. Ramanan

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803858

zbMATH Keywords

minimizationdecision treedeterministic finite automatonSet Partition Problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time solution to the single function coarsest partition problem

This page was built for publication: An efficient algorithm for a special case of the set partition problem