Title :
New NP-complete partition problems
Author :
Saeednia, Shahrokh
Author_Institution :
Departement d´´Informatique, Univ. Libre de Bruxelles, Brussels, Belgium
fDate :
7/1/2002 12:00:00 AM
Abstract :
Three new partition problems are proposed. The fact that these problems are NP-complete is shown
Keywords :
computational complexity; cryptography; decoding; NP-complete partition problems; cryptography; syndrome decoding; three-dimensional matching; Complexity theory; Cryptography; Decoding; Security;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.1013150
