ECCC - Reports tagged with branching programs, catalytic computation, direct sum, space bounded computation, lower bounds
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > BRANCHING PROGRAMS, CATALYTIC COMPUTATION, DIRECT SUM, SPACE BOUNDED COMPUTATION, LOWER BOUNDS:
Reports tagged with branching programs, catalytic computation, direct sum, space bounded computation, lower bounds:
TR15-138 | 25th August 2015
Michal Koucky

Nonuniform catalytic space and the direct sum for space

Revisions: 1

This paper initiates the study of $k$-catalytic branching programs, a nonuniform model of computation that is the counterpart to the uniform catalytic space model of Buhrman, Cleve, Koucky, Loff and Speelman (STOC 2014). A $k$-catalytic branching program computes $k$ boolean functions simultaneously on the same $n$-bit input. Each function has ... more >>>




ISSN 1433-8092 | Imprint