Publication:3821583
From MaRDI portal
zbMath0668.68051MaRDI QIDQ3821583
Publication date: 1988
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items
A simple function that requires exponential size read-once branching programs, Worst case examples for operations on OBDDs, Neither reading few bits twice nor reading illegally helps much, Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\), On the size of binary decision diagrams representing Boolean functions, A very simple function that requires exponential size read-once branching programs., On oblivious branching programs of linear length