Shlomo Jozeph. Universal Factor Graphs for Every NP-Hard Boolean CSP. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 274-283, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]
@inproceedings{Jozeph14,
title = {Universal Factor Graphs for Every NP-Hard Boolean CSP},
author = {Shlomo Jozeph},
year = {2014},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.274},
url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.274},
researchr = {https://researchr.org/publication/Jozeph14},
cites = {0},
citedby = {0},
pages = {274-283},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain},
editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
volume = {28},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-74-3},
}