New NP-complete partition problems

DOI10.1109/TIT.2002.1013150MaRDI QIDQ4677526zbMATH OpenFDO

Authors Shahrokh Saeednia

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.1013150

Mathematics Subject Classification ID

Partitions of sets (05A18) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05) Cryptography (94A60)

Cited in

(1)

• On the indecomposable partition problem: IPP(10, )

This page was built for publication: New NP-complete partition problems

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