pdfformat: 

@InProceedings{durand_et_al:LIPIcs:2014:4866, author = {Arnaud Durand and Meena Mahajan and Guillaume Malod and Nicolas de RugyAltherre and Nitin Saurabh}, title = {{Homomorphism Polynomials Complete for VP}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {493504}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897774}, ISSN = {18688969}, year = {2014}, volume = {29}, editor = {Venkatesh Raman and S. P. Suresh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4866}, URN = {urn:nbn:de:0030drops48665}, doi = {10.4230/LIPIcs.FSTTCS.2014.493}, annote = {Keywords: algebraic complexity, graph homomorphism, polynomials, VP, VNP, completeness} }
Keywords:  algebraic complexity, graph homomorphism, polynomials, VP, VNP, completeness  
Seminar:  34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)  
Issue date:  2014  
Date of publication:  2014 