Corpus ID: 3266496

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}
}
  • John Faben
  • Published 2008
  • Computer Science, Mathematics
  • ArXiv
  • 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

    Complexity Dichotomies of Counting Problems

    • Pinyan Lu
    • Mathematics, Computer Science
    • Electronic Colloquium on Computational Complexity
    • 2011

    A Dichotomy for Real Weighted Holant Problems

    • Sangxia Huang, Pinyan Lu
    • Computer Science, Mathematics
    • 2012 IEEE 27th Conference on Computational Complexity
    • 2012

    A Dichotomy for Real Weighted Holant Problems

    The Complexity of Parity Graph Homomorphism: An Initial Investigation

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    On the Complexity of Holant Problems

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES

    Complexity of Generalized Satisfiability Counting Problems

    VIEW 1 EXCERPT

    The complexity of satisfiability problems

    VIEW 1 EXCERPT

    Relations among MOD-classes

    VIEW 1 EXCERPT

    Complexity classifications of Boolean constraint satisfaction problems

    VIEW 1 EXCERPT

    The Complexity of Computing the Permanent

    Accidental algorthims

    • Leslie G. Valiant
    • Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
    • 2006
    VIEW 1 EXCERPT