Complexity of constraint satisfaction

Results: 53



#Item
1A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

Add to Reading List

Source URL: www.cse.cuhk.edu.hk

Language: English - Date: 2015-07-08 04:00:35
    2A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

    A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

    Add to Reading List

    Source URL: www.cs.toronto.edu

    - Date: 2008-09-17 15:06:39
      3A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan∗ Department of EECS UC Berkeley

      A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan∗ Department of EECS UC Berkeley

      Add to Reading List

      Source URL: www.cs.toronto.edu

      - Date: 2012-08-08 09:39:27
        4Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

        Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

        Add to Reading List

        Source URL: www.bedewell.com

        Language: English - Date: 2009-11-10 10:57:12
        5Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif  Fête of Combinatorics and Computer Science

        Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

        Add to Reading List

        Source URL: www.ifor.math.ethz.ch

        Language: English - Date: 2008-11-18 08:48:31
        6Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

        Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

        Add to Reading List

        Source URL: drops.dagstuhl.de

        Language: English - Date: 2015-11-09 10:22:02
        7Introduction & Motivation  Relations and Operations The complexity of positive equality-free first-order logic

        Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic

        Add to Reading List

        Source URL: www.bedewell.com

        Language: English - Date: 2010-09-09 14:15:56
        8Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

        Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

        Add to Reading List

        Source URL: www.bedewell.com

        Language: English - Date: 2011-07-07 11:03:52
        9The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

        The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

        Add to Reading List

        Source URL: ludovicpatey.com

        Language: English - Date: 2014-03-18 04:19:11
        10Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

        Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2007-10-29 10:15:11