New NP-complete partition problems
From MaRDI portal
Publication:4677526
DOI10.1109/TIT.2002.1013150zbMath1061.68066MaRDI QIDQ4677526
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Partitions of sets (05A18) Combinatorics in computer science (68R05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: New NP-complete partition problems