Search dblp for Publications

• > Home > Search

@inproceedings{DBLP:conf/cocoon/Liu23,
  author       = {Ying Liu},
  editor       = {Weili Wu and
                  Guangmo Tong},
  title        = {Exponential Time Complexity of the Complex Weighted Boolean {\#}CSP},
  booktitle    = {Computing and Combinatorics - 29th International Conference, {COCOON}
                  2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14422},
  pages        = {83--96},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-49190-0\_6},
  doi          = {10.1007/978-3-031-49190-0\_6},
  timestamp    = {Thu, 04 Jan 2024 08:13:45 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoon/Liu23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/CaiLX14,
  author       = {Jin{-}Yi Cai and
                  Pinyan Lu and
                  Mingji Xia},
  title        = {The complexity of complex weighted Boolean {\#}CSP},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {80},
  number       = {1},
  pages        = {217--236},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jcss.2013.07.003},
  doi          = {10.1016/J.JCSS.2013.07.003},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/CaiLX14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GuoHLX11,
  author       = {Heng Guo and
                  Sangxia Huang and
                  Pinyan Lu and
                  Mingji Xia},
  editor       = {Thomas Schwentick and
                  Christoph D{\"{u}}rr},
  title        = {The Complexity of Weighted Boolean {\#}CSP Modulo k},
  booktitle    = {28th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  series       = {LIPIcs},
  volume       = {9},
  pages        = {249--260},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2011.249},
  doi          = {10.4230/LIPICS.STACS.2011.249},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GuoHLX11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DyerGJ09,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mark Jerrum},
  title        = {The Complexity of Weighted Boolean {\#}CSP},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {5},
  pages        = {1970--1986},
  year         = {2009},
  url          = {https://doi.org/10.1137/070690201},
  doi          = {10.1137/070690201},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DyerGJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BulatovDGJR09,
  author       = {Andrei A. Bulatov and
                  Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Markus Jalsenius and
                  David Richerby},
  title        = {The complexity of weighted Boolean {\#}CSP with mixed signs},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {38-40},
  pages        = {3949--3961},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.06.003},
  doi          = {10.1016/J.TCS.2009.06.003},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BulatovDGJR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0812-4171,
  author       = {Andrei A. Bulatov and
                  Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Markus Jalsenius and
                  David Richerby},
  title        = {The Complexity of Weighted Boolean {\#}CSP with Mixed Signs},
  journal      = {CoRR},
  volume       = {abs/0812.4171},
  year         = {2008},
  url          = {http://arxiv.org/abs/0812.4171},
  eprinttype    = {arXiv},
  eprint       = {0812.4171},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0812-4171.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0704-3683,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mark Jerrum},
  title        = {The Complexity of Weighted Boolean {\#}CSP},
  journal      = {CoRR},
  volume       = {abs/0704.3683},
  year         = {2007},
  url          = {http://arxiv.org/abs/0704.3683},
  eprinttype    = {arXiv},
  eprint       = {0704.3683},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0704-3683.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}