• DocumentCode
    771778
  • Title

    New NP-complete partition problems

  • Author

    Saeednia, Shahrokh

  • Author_Institution
    Departement d´´Informatique, Univ. Libre de Bruxelles, Brussels, Belgium
  • Volume
    48
  • Issue
    7
  • fYear
    2002
  • fDate
    7/1/2002 12:00:00 AM
  • Firstpage
    2092
  • Lastpage
    2094
  • 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;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2002.1013150
  • Filename
    1013150
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=771778