Arithmetic Branching Programs with Memory

@inproceedings{Mengel2013ArithmeticBP,
  title={Arithmetic Branching Programs with Memory},
  author={S. Mengel},
  booktitle={MFCS},
  year={2013}
}
  • S. Mengel
  • Published in MFCS 2013
  • Mathematics, Computer Science
  • 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

    Figures and Topics from this paper

    Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials
    • 2
    • PDF
    The Arithmetic Complexity of Tensor Contraction
    • 5
    Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach
    • PDF

    References

    SHOWING 1-10 OF 23 REFERENCES
    Characterizing Valiant's algebraic complexity classes
    • 67
    • Highly Influential
    Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
    • 727
    • PDF
    Computing Algebraic Formulas Using a Constant Number of Registers
    • 149
    • Highly Influential
    The complexity of multiple-precision arithmetic
    • R. Brent
    • Computer Science, Mathematics
    • ArXiv
    • 2010
    • 26
    • PDF
    Lower bounds for non-commutative computation
    • N. Nisan
    • Mathematics, Computer Science
    • STOC '91
    • 1991
    • 186
    A Dichotomy Theorem for Polynomial Evaluation
    • 9
    • PDF
    Arithmetic circuits: The chasm at depth four gets wider
    • P. Koiran
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2012
    • 122
    • PDF
    A complexity theory based on Boolean algebra
    • Sven Skyum, L. Valiant
    • 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
    • 28
    • Highly Influential
    • PDF
    Completeness and Reduction in Algebraic Complexity Theory
    • P. Bürgisser
    • Mathematics, Computer Science
    • Algorithms and computation in mathematics
    • 2000
    • 196
    • Highly Influential
    • PDF