Homomorphism polynomials complete for VP
From MaRDI portal
Recommendations
Cites work
- A dichotomy theorem for homomorphism polynomials
- Arithmetic Circuits and Polynomial Replacement Systems
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- Fast Parallel Computation of Polynomials Using Few Processors
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
Cited in
(10)- Variants of homomorphism polynomials complete for algebraic complexity classes
- Homomorphism polynomials complete for VP
- scientific article; zbMATH DE number 1796947 (Why is no real title available?)
- Boundaries of VP and VNP
- Generalized matrix completion and algebraic natural proofs
- Monotone arithmetic complexity of graph homomorphism polynomials
- On the closures of monotone algebraic classes and variants of the determinant
- On the closures of monotone algebraic classes and variants of the determinant
- Variants of the determinant polynomial and VP-completeness
- Monotone bounded-depth complexity of homomorphism polynomials
This page was built for publication: Homomorphism polynomials complete for VP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808529)