\textsf{VNP} = \textsf{VP} in the multilinear world

DOI10.1016/J.IPL.2015.08.004MaRDI QIDQ894473zbMATH OpenOpenAlexFDO

Authors Meena Mahajan, Nitin Saurabh, Sébastien Tavenas

Publication date 1 December 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.08.004

zbMATH Keywords

computational complexityalgebraic complexitybranching programsmultilinear circuits

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On Hardness of Multilinearization and VNP-Completeness in Characteristic 2
• Strongly Exponential Separation between Monotone VP and Monotone VNP
• Characterizing Valiant’s Algebraic Complexity Classes
• On algebraic branching programs of small width
• Resource trade-offs in syntactically multilinear arithmetic circuits

Cites work

• scientific article; zbMATH DE number 3744549 (Why is no real title available?)
• Algebraic complexity classes
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
• Arithmetic circuits: a survey of recent results and open questions
• Characterizing Valiant's algebraic complexity classes
• Resource trade-offs in syntactically multilinear arithmetic circuits
• Separating multilinear branching programs and formulas
• Separation of multilinear circuit and formula size
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
• The black-box query complexity of polynomial summation

This page was built for publication: \textsf{VNP} = \textsf{VP} in the multilinear world

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894473)