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

DOI10.1016/j.ipl.2015.08.004zbMath1346.68098OpenAlexW1128179352MaRDI QIDQ894473

Nitin Saurabh, Meena Mahajan, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Resource trade-offs in syntactically multilinear arithmetic circuits
• The black-box query complexity of polynomial summation
• Characterizing Valiant's algebraic complexity classes
• Algebraic Complexity Classes
• Arithmetic Circuits: A survey of recent results and open questions
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
• Separating multilinear branching programs and formulas

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