Variants of the determinant polynomial and the \textsf{VP}-completeness
From MaRDI portal
Publication:2117074
Cites work
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- scientific article; zbMATH DE number 5485585 (Why is no real title available?)
- Arithmetic branching programs with memory
- Arithmetic circuits: a survey of recent results and open questions
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- Dichotomy theorems for homomorphism polynomials of graph classes
- Homomorphism polynomials complete for VP
- On Hardness of Multilinearization and VNP-Completeness in Characteristic 2
- Variants of homomorphism polynomials complete for algebraic complexity classes
This page was built for publication: Variants of the determinant polynomial and the \textsf{VP}-completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117074)