• DocumentCode
    3426704
  • Title

    Is SP BP?

  • Author

    Tu, Ronghui ; Mao, Yongyi ; Zhao, Jiying

  • Author_Institution
    Univ. of Ottawa, Ottawa
  • fYear
    2007
  • fDate
    2-6 Sept. 2007
  • Firstpage
    236
  • Lastpage
    241
  • Abstract
    In this paper, we investigate the problem how SP may be reduced from BP under certain Markov random field formalism of general constraint-satisfaction problems. We show that unlike the case of k-SAT problems, for general constraint satisfaction problems, certain extra manipulation of BP messages as well as some condition on the structure of the problem may be needed for BP to reduce to SP.
  • Keywords
    communication complexity; constraint theory; message passing; operations research; BP; Markov random field formalism; SP; general constraint-satisfaction problems; survey propagation; Channel coding; Information technology; Lakes; Markov random fields; NP-complete problem; Physics computing; Power engineering and energy; Source coding; Sufficient conditions; Vocabulary;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2007. ITW '07. IEEE
  • Conference_Location
    Tahoe City, CA
  • Print_ISBN
    1-4244-1564-0
  • Electronic_ISBN
    1-4244-1564-0
  • Type

    conf

  • DOI
    10.1109/ITW.2007.4313080
  • Filename
    4313080
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3426704