On Hardness of Multilinearization and VNP-Completeness in Characteristic 2

DOI10.1145/2940323zbMath1427.68107OpenAlexW2567588677MaRDI QIDQ4973864

Pavel Hrubeš

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2940323

zbMATH Keywords

multilinear polynomialVNP-completeness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Variants of the determinant polynomial and the \textsf{VP}-completeness

This page was built for publication: On Hardness of Multilinearization and VNP-Completeness in Characteristic 2