# The complexity of counting solutions to Generalised Satisfiability Problems modulo k

@article{Faben2008TheCO, title={The complexity of counting solutions to Generalised Satisfiability Problems modulo k}, author={John Faben}, journal={ArXiv}, year={2008}, volume={abs/0809.1836} }

Generalised Satisfiability Problems (or Boolean Constraint Satisfaction Problems), introduced by Schaefer in 1978, are a general class of problem which allow the systematic study of the complexity of satisfiability problems with different types of constraints. In 1979, Valiant introduced the complexity class parity P, the problem of counting the number of solutions to NP problems modulo two. Others have since considered the question of counting modulo other integers.
We give a dichotomy… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 11 CITATIONS

## The Complexity of Parity Graph Homomorphism: An Initial Investigation

VIEW 4 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

## The complexity of satisfiability problems

VIEW 1 EXCERPT

## On some central problems in computational complexity.

VIEW 1 EXCERPT

## Relations among MOD-classes

VIEW 1 EXCERPT

## Hard enumeration problems in geometry and combinatorics

VIEW 1 EXCERPT

## Accidental algorthims

VIEW 1 EXCERPT