1. Lecture Notes in Computer Science;P Chaugule,2019
2. Durand, A., Mahajan, M., Malod, G., de Rugy-Altherre, N., Saurabh, N.: Homomorphism polynomials complete for VP. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 29 (2014)
3. Engels, C.: Dichotomy theorems for homomorphism polynomials of graph classes. J. Graph Algorithms Appl. 20(1), 3–22 (2016)
4. Hrubes, P.: On hardness of multilinearization, and VNP completeness in characteristics two. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 22, p. 67 (2015). http://eccc.hpi-web.de/report/2015/067
5. Mahajan, M., Saurabh, N.: Some complete and intermediate polynomials in algebraic complexity theory. Theory Comput. Syst. 62(3), 622–652 (2018)