Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
From MaRDI portal
Publication:3392953
Recommendations
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
- Towards optimal simulations of formulas by bounded-width programs
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- Balancing bounded treewidth circuits
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
- Characterizing Valiant’s Algebraic Complexity Classes
- Completeness and reduction in algebraic complexity theory
- Computing Algebraic Formulas Using a Constant Number of Registers
- Fast Parallel Computation of Polynomials Using Few Processors
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- Lower bounds and separations for constant depth multilinear circuits
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- Nondeterministic NC^1 computation
- Reducibility by algebraic projections
Cited in
(7)- On the power of algebraic branching programs of width two
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
- \textsf{VNP} = \textsf{VP} in the multilinear world
- Skew circuits of small width
- Balancing bounded treewidth circuits
This page was built for publication: Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392953)
