Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

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.
Original languageEnglish
JournalACM Transactions on Computation Theory
Volume13
Issue number4
Pages (from-to)1-26
Number of pages26
ISSN1942-3454
DOIs
Publication statusPublished - 1 Sept 2021
Externally publishedYes

Keywords

  • Algebraic circuit complexity
  • Directed homomorphism
  • Injective homomorphism
  • Injective and directed homomorphism

Fingerprint

Dive into the research topics of 'Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes.'. Together they form a unique fingerprint.

Cite this