Correlation decay and deterministic FPTAS for counting list-colorings of a graph

David Gamarnik, Dmitriy Katz. Correlation decay and deterministic FPTAS for counting list-colorings of a graph. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 1245-1254, SIAM, 2007. [doi]

@inproceedings{GamarnikK07,
  title = {Correlation decay and deterministic FPTAS for counting list-colorings of a graph},
  author = {David Gamarnik and Dmitriy Katz},
  year = {2007},
  doi = {10.1145/1283383.1283517},
  url = {http://doi.acm.org/10.1145/1283383.1283517},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GamarnikK07},
  cites = {0},
  citedby = {0},
  pages = {1245-1254},
  booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007},
  editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein},
  publisher = {SIAM},
  isbn = {978-0-898716-24-5},
}