@InProceedings{durand_et_al:LIPIcs.FSTTCS.2014.493,
author = {Durand, Arnaud and Mahajan, Meena and Malod, Guillaume and de Rugy-Altherre, Nicolas and Saurabh, Nitin},
title = {{Homomorphism Polynomials Complete for VP}},
booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
pages = {493--504},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-77-4},
ISSN = {1868-8969},
year = {2014},
volume = {29},
editor = {Raman, Venkatesh and Suresh, S. P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.493},
URN = {urn:nbn:de:0030-drops-48665},
doi = {10.4230/LIPIcs.FSTTCS.2014.493},
annote = {Keywords: algebraic complexity, graph homomorphism, polynomials, VP, VNP, completeness}
}