There is no English translation for this web page.
------ Links: ------
Link to publication 
Link to original publication 
Download Bibtex entry
|Title of Book||Mathematical foundations of computer science 2013|
|Abstract||We extend the well known characterization of 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 characterizations of VP and VNP by branching programs with memory.|
Zusatzinformationen / Extras
Schnellnavigation zur Seite über Nummerneingabe
This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008