Arithmetic Branching Programs with Memory
@inproceedings{Mengel2013ArithmeticBP, title={Arithmetic Branching Programs with Memory}, author={S. Mengel}, booktitle={MFCS}, year={2013} }
We extend the well known characterization of the arithmetic circuit class VP ws as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of branching programs to make them more expressive. We show that allowing different types of memory in branching programs increases the computational power even for constant width programs. In particular, this leads to very natural and robust… CONTINUE READING
3 Citations
Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials
- Mathematics, Computer Science
- 2015
- 2
- PDF
The Arithmetic Complexity of Tensor Contraction
- Mathematics, Computer Science
- Theory of Computing Systems
- 2015
- 5
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
- Mathematics, Computer Science
- MFCS
- 2020
- PDF
References
SHOWING 1-10 OF 23 REFERENCES
Characterizing Valiant's algebraic complexity classes
- Computer Science
- J. Complex.
- 2008
- 67
- Highly Influential
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
- Mathematics, Computer Science
- STOC '86
- 1986
- 727
- PDF
Computing Algebraic Formulas Using a Constant Number of Registers
- Computer Science, Mathematics
- SIAM J. Comput.
- 1992
- 149
- Highly Influential
Arithmetic circuits: The chasm at depth four gets wider
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2012
- 122
- PDF
A complexity theory based on Boolean algebra
- Mathematics, Computer Science
- 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- 1981
- 124
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
- Computer Science
- Inf. Comput.
- 1995
- 28
- Highly Influential
- PDF
Completeness and Reduction in Algebraic Complexity Theory
- Mathematics, Computer Science
- Algorithms and computation in mathematics
- 2000
- 196
- Highly Influential
- PDF