International Symposium on Mathematical Foundations of Computer Science

MFCS 2013: Mathematical Foundations of Computer Science 2013 pp 667-678

Arithmetic Branching Programs with Memory

  • Stefan Mengel
Conference paper

DOI: 10.1007/978-3-642-40313-2_59

Volume 8087 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Mengel S. (2013) Arithmetic Branching Programs with Memory. In: Chatterjee K., Sgall J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg

Abstract

We extend the well known characterization of the arithmetic circuit class VPws 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 characterizations of VP and VNP by branching programs with memory.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Stefan Mengel
    • 1
  1. 1.Institute of MathematicsUniversity of PaderbornPaderbornGermany