Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR18-135 | 31st July 2018 20:11

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes


Authors: Prasad Chaugule, Nutan Limaye, Aditya Varre
Publication: 31st July 2018 21:02
Downloads: 77


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. (2016). 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.

ISSN 1433-8092 | Imprint