• DocumentCode
    2836480
  • Title

    Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems

  • Author

    Richoux, Florian

  • Author_Institution
    Japanese-French Lab. for Inf., Univ. of Tokyo, Tokyo, Japan
  • fYear
    2011
  • fDate
    17-18 July 2011
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this short note we show a dichotomy theorem for every finite domain D of CSP built upon graphs of homogeneous co-Boolean functions, i.e., unary functions sharing the Boolean range in D.
  • Keywords
    Boolean functions; computational complexity; constraint theory; operations research; CSP; dichotomy theorem; homogeneous coBoolean constraint satisfaction problem complexity; homogeneous coBoolean functions; Algebra; Biology; Complexity theory; Computer science; Equations; Informatics; Mathematical model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits, Communications and System (PACCS), 2011 Third Pacific-Asia Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4577-0855-8
  • Type

    conf

  • DOI
    10.1109/PACCS.2011.5990156
  • Filename
    5990156
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2836480