• DocumentCode
    1963770
  • Title

    Constraint Satisfaction Problems of Bounded Width

  • Author

    Barto, Libor ; Kozik, Marcin

  • Author_Institution
    Dept. of Algebra, Charles Univ., Prague, Czech Republic
  • fYear
    2009
  • fDate
    25-27 Oct. 2009
  • Firstpage
    595
  • Lastpage
    603
  • Abstract
    We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conjecture of Larose and Zadori.
  • Keywords
    combinatorial mathematics; computational complexity; constraint theory; bounded width; local consistency checking algorithm; nonuniform constraint satisfaction problem; Algebra; Artificial intelligence; Computational complexity; Computer science; Constraint theory; Electrooculography; Equations; Polynomials; bounded width; constraint satisfaction problem; local consistency;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on
  • Conference_Location
    Atlanta, GA
  • ISSN
    0272-5428
  • Print_ISBN
    978-1-4244-5116-6
  • Type

    conf

  • DOI
    10.1109/FOCS.2009.32
  • Filename
    5438595
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1963770