\textsf{VNP} = \textsf{VP} in the multilinear world (Q894473)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	\textsf{VNP} = \textsf{VP} in the multilinear world	scientific article

Statements

scholarly article

\textsf{VNP} = \textsf{VP} in the multilinear world (English)

Sébastien Tavenas

Information Processing Letters

publication date

1 December 2015

zbMATH Keywords

computational complexity

algebraic complexity

multilinear circuits

branching programs

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ipl.2015.08.004

Arithmetic Circuits: A survey of recent results and open questions

Algebraic Complexity Classes

Resource trade-offs in syntactically multilinear arithmetic circuits

Characterizing Valiant's algebraic complexity classes

Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity

The black-box query complexity of polynomial summation

Separating multilinear branching programs and formulas

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.IPL.2015.08.004

Sitelinks

Mathematics(1 entry)

mardi Publication:894473

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q894473&oldid=38526076"