# Complexity Dichotomies for CSP-related Problems

@inproceedings{Nordh2007ComplexityDF, title={Complexity Dichotomies for CSP-related Problems}, author={Gustav Nordh}, year={2007} }

- Published 2007

Ladner’s theorem states that if P 6= NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. Csp(Γ) problems are of the form: given a set of variables constrained by a set of constraints from the set of allowed constraints Γ, is there an assignment to the variables satisfying all constraints? A famous, and in the light of Ladner’s theorem, surprising conjecture states that there is a… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 50 REFERENCES

## A dichotomy theorem for constraint satisfaction problems on a 3-element set

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Complexity of Generalized Satisfiability Counting Problems

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## On the complexity of H-coloring

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The complexity of satisfiability problems

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Computational complexity

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## The Complexity of Closed World Reasoning and Circumscription

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Existence theorems for weakly symmetric operations

VIEW 1 EXCERPT

## Finite Model Theory and Its Applications

VIEW 1 EXCERPT

#### Similar Papers

Loading similar papers…