We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and, VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. [10]. We consider three different variants of graph homomorphisms, namely injective homomorphisms, directed homomorphisms and injective directed homomorphisms and obtain polynomial families complete for VF, VBP, VP, and VNP under each one of these. The polynomial families have the following properties: The polynomial families complete for VF,VBP, and VP are model independent, i.e. they do not use a particular instance of a formula, ABP or circuit for characterising VF, VBP, or VP, respectively.All the polynomial families are hard under p-projections.
CITATION STYLE
Chaugule, P., Limaye, N., & Varre, A. (2019). Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11653 LNCS, pp. 90–102). Springer Verlag. https://doi.org/10.1007/978-3-030-26176-4_8
Mendeley helps you to discover research relevant for your work.