myrefs.bib

@article{Trichotomy,
 author = {Martin E. Dyer and Leslie A. Goldberg and Jerrum, Mark},
 title = {An approximation trichotomy for {B}oolean \#{CSP}},
 journal = {J. Comput. Syst. Sci.},
 volume = {76},
 issue = {3-4},
 month = {May},
 year = {2010},
 issn = {0022-0000},
 pages = {267--277},
 numpages = {11},
 url = {http://dx.doi.org/10.1016/j.jcss.2009.08.003},
 doi = {http://dx.doi.org/10.1016/j.jcss.2009.08.003},
 acmid = {1767624},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
} 

@inproceedings{Dyer,
	author = {Martin E. Dyer and Catherine S. Greenhill},
	title = {The complexity of counting graph homomorphisms},
	booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms},
	series = {SODA '00},
	year = {2000},
	isbn = {0-89871-453-2},
	location = {San Francisco, California, United States},
	pages = {246--255},
	numpages = {10},
	url = {http://dl.acm.org/citation.cfm?id=338219.338259},
	acmid = {338259},
	publisher = {Society for Industrial and Applied Mathematics},
	address = {Philadelphia, PA, USA},
} 


@article{Jeavons,
	author    = {Peter Jeavons and David A. Cohen and Marc Gyssens},
	title     = {Closure properties of constraints},
	journal   = {J. ACM},
	volume    = {44},
	number    = {4},
	year      = {1997},
	pages     = {527-548},
	ee        = {db/journals/jacm/JeavonsCG97.html, http://doi.acm.org/10.1145/263867.263489},
	bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{pavol,
	author    = {Pavol Hell and Jaroslav {Ne\v{s}et\v{r}il}},
	title     = {On the complexity of {H}-coloring},
	journal   = {J. Comb. Theory, Ser. B},
	volume    = {48},
	number    = {1},
	year      = {1990},
	pages     = {92-110},
	ee        = {http://dx.doi.org/10.1016/0095-8956(90)90132-J},
	bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Nadia,
	author    = {Nadia Creignou and Miki Hermann},
	title     = {Complexity of Generalized Satisfiability Counting Problems},
	journal   = {Inf. Comput.},
	volume    = {125},
	number    = {1},
	year      = {1996},
	pages     = {1-12},
	ee        = {http://dx.doi.org/10.1006/inco.1996.0016},
	bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Bulatov,
	author    = {Andrei A. Bulatov},
	title     = {The Complexity of the Counting Constraint Satisfaction Problem},
	booktitle = {ICALP (1)},
	year      = {2008},
	pages     = {646-661},
	ee        = {http://dx.doi.org/10.1007/978-3-540-70575-8_53},
	bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{DyerR10,
	author    = {Martin E. Dyer and David Richerby},
	title     = {On the complexity of \#{CSP}},
	booktitle = {STOC},
	year      = {2010},
	pages     = {725-734},
	ee        = {http://doi.acm.org/10.1145/1806689.1806789},
	bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Luby,
	author = {Luby, Michael and Veli\v{c}kovic, Boban},
	title = {On deterministic approximation of DNF},
	booktitle = {Proceedings of the twenty-third annual ACM symposium on Theory of computing},
	series = {STOC '91},
	year = {1991},
	isbn = {0-89791-397-3},
	location = {New Orleans, Louisiana, United States},
	pages = {430--438},
	numpages = {9},
	url = {http://doi.acm.org/10.1145/103418.103464},
	doi = {http://doi.acm.org/10.1145/103418.103464},
	acmid = {103464},
	publisher = {ACM},
	address = {New York, NY, USA},
} 

@article{Jerrum,
	author = {Jerrum, Mark},
	title = {A very simple algorithm for estimating the number of k-colorings of a low-degree graph},
	journal = {Random Struct. Algorithms},
	volume = {7},
	issue = {2},
	month = {September},
	year = {1995},
	issn = {1042-9832},
	pages = {157--165},
	numpages = {9},
	url = {http://dl.acm.org/citation.cfm?id=226250.226262},
	doi = {10.1002/rsa.3240070205},
	acmid = {226262},
	publisher = {John Wiley \& Sons, Inc.},
	address = {New York, NY, USA},
}

@incollection{Leslie03,
	author = {Martin E. Dyer and Leslie A. Goldberg and Catherine S. Greenhill and Mark Jerrum},
	affiliation = {University of Leeds Leeds School of Computer Studies LS2 9JT UK},
	title = {On the Relative Complexity of Approximate Counting Problems},
	booktitle = {Approximation Algorithms for Combinatorial Optimization},
	series = {LNCS},
	editor = {Jansen, Klaus and Khuller, Samir},
	publisher = {Springer Berlin / Heidelberg},
	isbn = {978-3-540-67996-7},
	keyword = {Computer Science},
	pages = {557-570},
	volume = {1913},
	url = {http://dx.doi.org/10.1007/3-540-44436-X_12},
	note = {10.1007/3-540-44436-X\_12},
	year = {2000}
}

@BOOK{hellbook,
	title={Graphs and homomorphisms},
	author={Pavol Hell and Jaroslav {Ne\v{s}et\v{r}il}},
	isbn={9780198528173},
	lccn={2004533593},
	series={Oxford lecture series in mathematics and its applications},
	url={http://books.google.ca/books?id=bJXWV-qK7kYC},
	year={2004},
	publisher={Oxford University Press}
}

@BOOK{madu,
	title = {Complexity {C}lassifications of {B}oolean {C}onstraint {S}atisfaction {P}roblems},
	publisher = {SIAM},
	address = {Philadephia, PA},
	year = {2001},
	doi = {DOI:10.1137/1.9780898718546},
	isbn = {9780898718546},
	author = {Nadia Creignou  and  Sanjeev Khanna and Madhu Sudan},
	url = {http://link.aip.org/link/doi/10.1137/1.9780898718546},
}

@article{Valiant1979,
	author = {Leslie G. Valiant},
	citeulike-article-id = {2927325},
	journal = {SIAM Journal on Computing},
	keywords = {comp, comprehensive, phd, ppi\_network},
	number = {3},
	pages = {410--421},
	posted-at = {2008-06-25 20:42:10},
	priority = {2},
	publisher = {SIAM},
	title = {{The Complexity of Enumeration and Reliability Problems}},
	volume = {8},
	year = {1979}
}

@inproceedings{cook1971,
	author = {Stephen A. Cook},
	address = {New York},
	booktitle = {Proceedings of the Third Annual ACM Symposium},
	organization = {ACM},
	pages = {151--158},
	title = {The complexity of theorem proving procedures},
	year = 1971,
	keywords = {complexity propositional-logic sat},
	added-at = {2008-02-20T02:37:25.000+0100},
}

@book{lau,
	author = {Dietlinde Lau},
	title = {Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)},
	year = {2006},
	isbn = {3540360220},
	publisher = {Springer-Verlag New York, Inc.},
	address = {Secaucus, NJ, USA},
}  

@article{bkkr69,
   author = {Bodnarchuk, V. G. and Kaluzhnin, L. A. and Kotov, V. N. and Romov, B. A.},
   title = {Galois theory for {P}ost algebras. {I}},
   journal = {Cybernetics and Systems Analysis},
   publisher = {Springer New York},
   issn = {1060-0396},
   keyword = {Computer Science},
   pages = {243-252},
   volume = {5},
   issue = {3},
   url = {http://dx.doi.org/10.1007/BF01070906},
   note = {10.1007/BF01070906},
   year = {1969}
}

@article{rom81,
   author = {Romov, B. A.},
   title = {The algebras of partial functions and their invariants},
   journal = {Cybernetics and Systems Analysis},
   publisher = {Springer New York},
   issn = {1060-0396},
   keyword = {Computer Science},
   pages = {157-167},
   volume = {17},
   issue = {2},
   url = {http://dx.doi.org/10.1007/BF01069627},
   note = {10.1007/BF01069627},
   year = {1981}
}

@article{gei68,
    annote = {American counterpart of Bodnarchuk69.},
    author = {David Geiger},
    citeulike-article-id = {8904523},
    journal = {Pacific Journal of Mathematics},
    keywords = {logic},
    pages = {95--100},
    posted-at = {2011-02-28 21:51:34},
    priority = {0},
    title = {{Closed Systems of Functions and Predicates}},
    volume = {27},
    year = {1968}
}

@article{Bulatov07,
  author    = {Andrei A. Bulatov and V\'{\i}ctor Dalmau},
  title     = {Towards a dichotomy theorem for the counting constraint satisfaction problem},
  journal   = {Inf. Comput.},
  volume    = {205},
  number    = {5},
  year      = {2007},
  pages     = {651-678},
  ee        = {http://dx.doi.org/10.1016/j.ic.2006.09.005},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{ValVaz,
 author = {Leslie G. Valiant and Vijay V. Vazirani},
 title = {{NP} is as easy as detecting unique solutions},
 booktitle = {Proceedings of the seventeenth annual ACM symposium on Theory of computing},
 series = {STOC '85},
 year = {1985},
 isbn = {0-89791-151-2},
 location = {Providence, Rhode Island, United States},
 pages = {458--463},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/22145.22196},
 doi = {http://doi.acm.org/10.1145/22145.22196},
 acmid = {22196},
 publisher = {ACM},
 address = {New York, NY, USA},
}


@INPROCEEDINGS{Jerrum96,
    author = {Mark Jerrum and Alistair Sinclair},
    title = {The {M}arkov chain {M}onte {C}arlo method: an approach to approximate counting and integration},
    booktitle = {Approximation Algorithms for NP-hard Problems},
    year = {1996},
    pages = {482--520},
    publisher = {PWS Publishing}
}

@book{welsh,
  title={Complexity: knots, colourings and counting},
  author={Dominic Welsh},
  isbn={9780521457408},
  lccn={gb93044515},
  series={London Mathematical Society lecture note series},
  url={http://books.google.com/books?id=A1lFBqXoMSkC},
  year={1993},
  publisher={Cambridge University Press}
}

@Book{post41,
  author = "Emil L. Post",
  title = "The two-valued iterative systems of mathematical logic",
  series = "Annals Mathematical Studies",
  volume ="5",
  publisher = "Princeton University Press",
  year = "1941",
}

@article{BDGJJR2010,
  author    = {Andrei A. Bulatov and
               Martin E. Dyer and
               Leslie A. Goldberg and
               Markus Jalsenius and
               Mark Jerrum and
               David Richerby},
  title     = {The complexity of weighted and unweighted \#{CSP}},
  journal   = {CoRR},
  volume    = {abs/1005.2678},
  year      = {2010},
  ee        = {http://arxiv.org/abs/1005.2678},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{recent08,
  author    = {Andrei A. Bulatov and Matthew Valeriote},
  title     = {Recent Results on the Algebraic Approach to the {CSP}},
  booktitle = {Complexity of Constraints},
  year      = {2008},
  pages     = {68-92},
  ee        = {http://dx.doi.org/10.1007/978-3-540-92800-3_4},
}

@Article{lovasz,
	author = {L\'{a}szl\'{o} Lov\'{a}sz},
	title = {Operations with structures },
	journal = {Acta Mathematica Hungarica},
	year = {1967},
	volume = {18},
	number = {3-4},
	pages = {321-328},
}

@article{JVV,
  author    = {Mark Jerrum and
               Leslie G. Valiant and
               Vijay V. Vazirani},
  title     = {Random Generation of Combinatorial Structures from a Uniform
               Distribution},
  journal   = {Theor. Comput. Sci.},
  volume    = {43},
  year      = {1986},
  pages     = {169-188},
  ee        = {http://dx.doi.org/10.1016/0304-3975(86)90174-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Sampling,
 author = {Martin E. Dyer and Leslie A. Goldberg and Mark Jerrum},
 title = {Counting and sampling {H}-colourings},
 journal = {Inf. Comput.},
 volume = {189},
 issue = {1},
 month = {February},
 year = {2004},
 issn = {0890-5401},
 pages = {1--16},
 numpages = {16},
 url = {http://dl.acm.org/citation.cfm?id=982284.982285},
 doi = {10.1016/j.ic.2003.09.001},
 acmid = {982285},
 publisher = {Academic Press, Inc.},
 address = {Duluth, MN, USA},
} 

@ARTICLE{Jer93,
    author = {Mark Jerrum and Alistair Sinclair},
    title = {Polynomial-time approximation algorithms for the {I}sing model},
    journal = {SIAM Journal on Computing},
    year = {1993},
    volume = {22},
    pages = {1087--1116}
}

@article{Goldberg2007,
author = {Leslie A. Goldberg and Mark Jerrum},
doi = {10.1017/S096354830600767X},
issn = {0963-5483},
journal = {Combinatorics, Probability and Computing},
month = aug,
number = {01},
pages = {43--61},
publisher = {Cambridge Univ Press},
title = {{The complexity of ferromagnetic Ising with local fields}},
url = {http://www.journals.cambridge.org/abstract\_S096354830600767X http://journals.cambridge.org/abstract\_S096354830600767X},
volume = {16},
year = {2007}
}

@article{counting,
  author    = {Martin E. Dyer and
               Leslie A. Goldberg and
               Catherine S. Greenhill and
               Mark Jerrum},
  title     = {The Relative Complexity of Approximate Counting Problems},
  journal   = {Algorithmica},
  volume    = {38},
  number    = {3},
  year      = {2003},
  pages     = {471-500},
}

@article{Madras,
	title={{M}onte-{C}arlo approximation algorithms for enumeration problems}, 
	volume={10}, 
	url={http://linkinghub.elsevier.com/retrieve/pii/0196677489900382}, 
	number={3}, 
	journal={Journal of Algorithms}, 
	publisher={Academic Press, Inc.}, 
	author={Richard M. Karp, Michael Luby, Neal Madras}, 
	year={1989}, 
	pages={429--448}
}

@article{Rosenberg,
	title={{T}he {G}alois connection between partial functions and relations},
	author={Isidore Fleischer and Ivo G. Rosenberg},
	year={1978},
	journal={Pacific J. Math},
	volume={79},
	number={1},
	pages={93-97}
}

@article{mvl,
  author    = {Andrei A. Bulatov and Amir Hedayaty},
  title     = {Counting Problems and Clones of Functions},
  journal   = {Multiple-Valued Logic and Soft Computing},
  volume    = {18},
  number    = {2},
  year      = {2012},
  pages     = {117-138},
}

@inproceedings{maxi,
  author    = {Andrei A. Bulatov and
               Amir Hedayaty},
  title     = {Counting Predicates, Subset Surjective Functions, and Counting
               CSPs},
  booktitle = {ISMVL},
  year      = {2012},
  pages     = {331-336},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2012.46},
}

@incollection {propertytesting,
   author = {Borgs, Christian and Chayes, Jennifer and Lov\'{a}sz, L\'{a}szl\'{o} and S\'{o}s,
   Vera T. and Vesztergombi, Katalin},
   affiliation = {Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA},
   title = {Counting Graph Homomorphisms},
   booktitle = {Topics in Discrete Mathematics},
   series = {Algorithms and Combinatorics},
   editor = {Klazar, Martin and Kratochv\'{i}l, Jan and Loebl, Martin and Matou\v{s}ek, Ji\v{r}\'{i} and Valtr, Pavel and Thomas, Robin},
   publisher = {Springer Berlin Heidelberg},
   isbn = {978-3-540-33700-3},
   keyword = {Mathematics and Statistics},
   pages = {315-371},
   volume = {26},
   url = {http://dx.doi.org/10.1007/3-540-33700-8_18},
   year = {2006}
}

@article{dur628,
          volume = {34},
          number = {3},
           month = {April},
          author = {Andrei A. Bulatov and  Peter Jeavons and  Andrei Krokhin},
           title = {Classifying the complexity of constraints using finite algebras.},
       publisher = {Society for Industrial and Applied Mathematics},
            year = {2005},
         journal = {SIAM journal on computing.},
           pages = {720--742},
        keywords = {Constraint satisfaction problem, Universal algebra, Dichotomy theorem.},
             url = {http://dro.dur.ac.uk/628/},
}

@article{valeriote,
	author= {Matthew Valeriote},
	title = {A subalgebra intersection property for congruence distributive varieties.}, 
	year = {2009},
	journal = {Canad. J. Math.},
	volume = {61},
	pages = {451-464},
}

@article{cspconj,
  author    = {Tom{\'a}s Feder and
               Moshe Y. Vardi},
  title     = {The Computational Structure of Monotone Monadic SNP and
               Constraint Satisfaction: A Study through Datalog and Group
               Theory},
  journal   = {SIAM J. Comput.},
  volume    = {28},
  number    = {1},
  year      = {1998},
  pages     = {57-104},
  ee        = {http://dx.doi.org/10.1137/S0097539794266766},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{listhom,
  author    = {Tom{\'a}s Feder and
               Pavol Hell},
  title     = {List Homomorphisms to Reflexive Graphs},
  journal   = {J. Comb. Theory, Ser. B},
  volume    = {72},
  number    = {2},
  year      = {1998},
  pages     = {236-250},
  ee        = {http://dx.doi.org/10.1006/jctb.1997.1812},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@article{DR83,
     jstor_articletype = {research-article},
     title = {Graphs Orientable as Distributive Lattices},
     author = {Duffus, Dwight and Rival, Ivan},
     journal = {Proceedings of the American Mathematical Society},
     jstor_issuetitle = {},
     volume = {88},
     number = {2},
     jstor_formatteddate = {Jun., 1983},
     pages = {pp. 197-200},
     url = {http://www.jstor.org/stable/2044697},
     ISSN = {00029939},
     language = {English},
     year = {1983},
     publisher = {American Mathematical Society},
}

@article{Gutin,
  author    = {Gregory Gutin and
               Pavol Hell and
               Arash Rafiey and
               Anders Yeo},
  title     = {A dichotomy for minimum cost graph homomorphisms},
  journal   = {Eur. J. Comb.},
  volume    = {29},
  number    = {4},
  year      = {2008},
  pages     = {900-911},
}

% vim: paste