Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.
- ,
- Prasad Chaugule,
- Aditya Varre
- Indian Institute of Technology Bombay,
- Ecole Polytechnique Fédérale de Lausanne
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 1-26 (26 pages)Journal (Volume, Issue Number)
ACM Transactions on Computation Theory (Volume 13, Issue 4)Publication milestones
- Published - 01/09/2021
Publication status
Published - 01/09/2021
ISSN
1942-3454Publication IDs
- Scopus: 85114371458
Abstract
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. (2018). 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, algebraic branching programs, or circuit for characterising VF, VBP, or VP, respectively.
• All the polynomial families are hard under p-projections.
• The polynomial families complete for VF, VBP, and VP are model independent, i.e., they do not use a particular instance of a formula, algebraic branching programs, or circuit for characterising VF, VBP, or VP, respectively.
• All the polynomial families are hard under p-projections.
Publication metrics
PlumX, opens in new tab
Citations
3
Captures
3
Access to documents
License:Unspecified
